/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:01:01,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:01:01,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:01:01,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:01:01,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:01:01,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:01:01,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:01:01,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:01:01,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:01:01,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:01:01,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:01:01,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:01:01,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:01:01,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:01:01,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:01:01,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:01:01,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:01:01,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:01:01,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:01:01,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:01:01,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:01:01,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:01:01,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:01:01,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:01:01,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:01:01,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:01:01,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:01:01,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:01:01,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:01:01,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:01:01,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:01:01,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:01:01,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:01:01,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:01:01,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:01:01,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:01:01,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:01:01,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:01:01,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:01:01,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:01:01,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:01:01,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:01:01,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:01:01,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:01:01,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:01:01,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:01:01,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:01:01,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:01:01,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:01:01,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:01:01,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:01:01,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:01:01,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:01:01,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:01:01,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:01:01,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:01:01,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:01:01,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:01:01,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:01:01,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:01:01,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:01:01,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:01:01,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:01:01,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:01:01,874 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:01:01,874 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:01:01,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:01:01,874 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:01:01,874 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:01:02,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:01:02,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:01:02,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:01:02,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:01:02,141 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:01:02,142 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+lhb-reducer.c [2022-04-08 04:01:02,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba292b04/113bb85decb24ccd9184444cd3595b87/FLAG08366df68 [2022-04-08 04:01:02,573 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:01:02,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-08 04:01:02,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba292b04/113bb85decb24ccd9184444cd3595b87/FLAG08366df68 [2022-04-08 04:01:02,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba292b04/113bb85decb24ccd9184444cd3595b87 [2022-04-08 04:01:02,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:01:02,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:01:02,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:01:02,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:01:02,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:01:02,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:01:02" (1/1) ... [2022-04-08 04:01:02,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4633276b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:02, skipping insertion in model container [2022-04-08 04:01:02,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:01:02" (1/1) ... [2022-04-08 04:01:03,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:01:03,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:01:03,180 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+lhb-reducer.c[1444,1457] [2022-04-08 04:01:03,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:01:03,191 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:01:03,209 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+lhb-reducer.c[1444,1457] [2022-04-08 04:01:03,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:01:03,222 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:01:03,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03 WrapperNode [2022-04-08 04:01:03,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:01:03,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:01:03,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:01:03,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:01:03,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:01:03,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:01:03,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:01:03,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:01:03,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (1/1) ... [2022-04-08 04:01:03,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:01:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:03,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:01:03,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:01:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:01:03,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:01:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:01:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:01:03,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:01:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:01:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:01:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:01:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:01:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:01:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:01:03,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:01:03,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:01:03,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:01:03,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:01:03,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:01:03,608 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:01:03,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:01:03,624 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 04:01:03,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:01:03 BoogieIcfgContainer [2022-04-08 04:01:03,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:01:03,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:01:03,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:01:03,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:01:03,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:01:02" (1/3) ... [2022-04-08 04:01:03,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cd5b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:01:03, skipping insertion in model container [2022-04-08 04:01:03,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:01:03" (2/3) ... [2022-04-08 04:01:03,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cd5b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:01:03, skipping insertion in model container [2022-04-08 04:01:03,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:01:03" (3/3) ... [2022-04-08 04:01:03,651 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.c [2022-04-08 04:01:03,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:01:03,655 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:01:03,699 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:01:03,708 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:01:03,708 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:01:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-08 04:01:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:01:03,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:03,756 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:03,757 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 1 times [2022-04-08 04:01:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739365402] [2022-04-08 04:01:03,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1579444895, now seen corresponding path program 2 times [2022-04-08 04:01:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051980997] [2022-04-08 04:01:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:03,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:03,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778073084] [2022-04-08 04:01:03,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:03,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:03,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:01:03,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:01:03,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:04,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 04:01:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:04,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:04,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-08 04:01:04,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_96~0 := 0; {24#true} is VALID [2022-04-08 04:01:04,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 04:01:04,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID [2022-04-08 04:01:04,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 04:01:04,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#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; {24#true} is VALID [2022-04-08 04:01:04,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~main__n~0); {24#true} is VALID [2022-04-08 04:01:04,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:04,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(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; {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:04,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(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; {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:01:04,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(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; {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:04,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(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; {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:04,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ 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; {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-08 04:01:04,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} 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; {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:04,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2022-04-08 04:01:04,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 04:01:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:01:04,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:01:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:04,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051980997] [2022-04-08 04:01:04,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:04,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778073084] [2022-04-08 04:01:04,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778073084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:04,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:04,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:01:04,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:04,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739365402] [2022-04-08 04:01:04,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739365402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:04,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:04,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:01:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904388520] [2022-04-08 04:01:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:04,669 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-08 04:01:04,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:04,674 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-08 04:01:04,700 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-08 04:01:04,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:01:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:01:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:01:04,733 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 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-08 04:01:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:05,156 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 04:01:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:01:05,156 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-08 04:01:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:05,158 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-08 04:01:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 04:01:05,166 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-08 04:01:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 04:01:05,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 04:01:05,219 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-08 04:01:05,225 INFO L225 Difference]: With dead ends: 41 [2022-04-08 04:01:05,225 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 04:01:05,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:01:05,229 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:05,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:01:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 04:01:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 04:01:05,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:05,255 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-08 04:01:05,255 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-08 04:01:05,256 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-08 04:01:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:05,258 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 04:01:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 04:01:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:05,259 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-08 04:01:05,259 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-08 04:01:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:05,261 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-08 04:01:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 04:01:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:05,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:05,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:05,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:05,262 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-08 04:01:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 04:01:05,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-08 04:01:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:05,265 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 04:01:05,265 INFO L479 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-08 04:01:05,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 04:01:05,280 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-08 04:01:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 04:01:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:01:05,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:05,281 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:05,298 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-08 04:01:05,482 WARN L460 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-08 04:01:05,482 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 1 times [2022-04-08 04:01:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040940623] [2022-04-08 04:01:05,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1718213942, now seen corresponding path program 2 times [2022-04-08 04:01:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348239540] [2022-04-08 04:01:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:05,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:05,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252695671] [2022-04-08 04:01:05,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:05,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:05,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:05,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:01:05,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:05,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:05,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 04:01:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:05,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:06,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-08 04:01:06,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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_96~0 := 0; {236#true} is VALID [2022-04-08 04:01:06,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-08 04:01:06,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-08 04:01:06,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-08 04:01:06,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#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; {236#true} is VALID [2022-04-08 04:01:06,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {259#(<= 1 main_~main__n~0)} is VALID [2022-04-08 04:01:06,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {263#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:06,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(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; {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:01:06,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~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; {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:06,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 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; {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:06,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 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; {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:06,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {279#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 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; {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:06,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {283#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 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; {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 04:01:06,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~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; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:06,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-08 04:01:06,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-08 04:01:06,115 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-08 04:01:06,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:06,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-08 04:01:06,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {237#false} is VALID [2022-04-08 04:01:06,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(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; {291#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:06,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {304#(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-08 04:01:06,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(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; {308#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 04:01:06,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(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; {312#(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-08 04:01:06,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#(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; {316#(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-08 04:01:06,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(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; {320#(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-08 04:01:06,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(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; {324#(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-08 04:01:06,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {328#(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-08 04:01:06,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#true} assume !!(1 <= ~main__n~0); {236#true} is VALID [2022-04-08 04:01:06,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#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; {236#true} is VALID [2022-04-08 04:01:06,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-08 04:01:06,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #58#return; {236#true} is VALID [2022-04-08 04:01:06,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-08 04:01:06,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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_96~0 := 0; {236#true} is VALID [2022-04-08 04:01:06,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-08 04:01:06,526 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-08 04:01:06,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:06,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348239540] [2022-04-08 04:01:06,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:06,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252695671] [2022-04-08 04:01:06,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252695671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:06,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:06,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-04-08 04:01:06,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:06,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040940623] [2022-04-08 04:01:06,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040940623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:06,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:06,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:01:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516001068] [2022-04-08 04:01:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:06,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:06,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:01:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:01:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:01:06,548 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:06,793 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 04:01:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:01:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 04:01:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 04:01:06,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 22 transitions. [2022-04-08 04:01:06,819 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-08 04:01:06,820 INFO L225 Difference]: With dead ends: 22 [2022-04-08 04:01:06,820 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 04:01:06,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:01:06,822 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:06,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:01:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 04:01:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 04:01:06,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:06,835 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-08 04:01:06,835 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-08 04:01:06,835 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-08 04:01:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:06,837 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 04:01:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 04:01:06,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:06,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:06,837 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-08 04:01:06,838 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-08 04:01:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:06,839 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 04:01:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 04:01:06,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:06,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:06,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:06,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:06,840 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-08 04:01:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-08 04:01:06,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-08 04:01:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:06,841 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-08 04:01:06,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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-08 04:01:06,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-08 04:01:06,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 04:01:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:01:06,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:06,863 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:06,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:07,086 WARN L460 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-08 04:01:07,087 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 3 times [2022-04-08 04:01:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:07,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343317336] [2022-04-08 04:01:07,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1725087103, now seen corresponding path program 4 times [2022-04-08 04:01:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:07,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821843243] [2022-04-08 04:01:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:07,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889353789] [2022-04-08 04:01:07,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:01:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:07,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:07,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:01:07,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:01:07,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:07,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 04:01:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:07,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:07,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-08 04:01:07,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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_96~0 := 0; {477#true} is VALID [2022-04-08 04:01:07,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-08 04:01:07,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-08 04:01:07,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-08 04:01:07,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#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; {477#true} is VALID [2022-04-08 04:01:07,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-08 04:01:07,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {503#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:07,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(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; {507#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:01:07,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(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; {511#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:01:07,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {511#(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; {515#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:07,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(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; {519#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 04:01:07,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#(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; {523#(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-08 04:01:07,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {523#(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; {527#(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-08 04:01:07,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {527#(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; {531#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:01:07,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {531#(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; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:07,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-08 04:01:07,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-08 04:01:07,546 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-08 04:01:07,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:08,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-08 04:01:08,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {478#false} is VALID [2022-04-08 04:01:08,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {548#(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; {535#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:08,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {548#(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-08 04:01:08,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {552#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:08,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(1 <= ~main__n~0); {477#true} is VALID [2022-04-08 04:01:08,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#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; {477#true} is VALID [2022-04-08 04:01:08,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret5 := main(); {477#true} is VALID [2022-04-08 04:01:08,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #58#return; {477#true} is VALID [2022-04-08 04:01:08,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-08 04:01:08,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#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_96~0 := 0; {477#true} is VALID [2022-04-08 04:01:08,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2022-04-08 04:01:08,710 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-08 04:01:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821843243] [2022-04-08 04:01:08,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889353789] [2022-04-08 04:01:08,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889353789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:08,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:08,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2022-04-08 04:01:08,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343317336] [2022-04-08 04:01:08,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343317336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:08,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:08,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:01:08,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471943182] [2022-04-08 04:01:08,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:08,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:08,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,729 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-08 04:01:08,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:01:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:01:08,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:01:08,731 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:08,961 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 04:01:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:01:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-08 04:01:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-08 04:01:08,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2022-04-08 04:01:08,988 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-08 04:01:08,988 INFO L225 Difference]: With dead ends: 23 [2022-04-08 04:01:08,989 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 04:01:08,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:01:08,990 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:08,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:01:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 04:01:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 04:01:09,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:09,003 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-08 04:01:09,004 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-08 04:01:09,004 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-08 04:01:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:09,005 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 04:01:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 04:01:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:09,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:09,006 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-08 04:01:09,006 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-08 04:01:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:09,007 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 04:01:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 04:01:09,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:09,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:09,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:09,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:09,008 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-08 04:01:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 04:01:09,009 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-08 04:01:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:09,009 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 04:01:09,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-08 04:01:09,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 04:01:09,027 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-08 04:01:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 04:01:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 04:01:09,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:09,028 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:09,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:09,251 WARN L460 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-08 04:01:09,252 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 5 times [2022-04-08 04:01:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184023873] [2022-04-08 04:01:09,253 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1938155094, now seen corresponding path program 6 times [2022-04-08 04:01:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:09,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992263799] [2022-04-08 04:01:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:09,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:09,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136580085] [2022-04-08 04:01:09,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:01:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:09,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:09,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 04:01:09,372 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 04:01:09,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:09,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 04:01:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:09,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:09,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-08 04:01:09,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#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_96~0 := 0; {725#true} is VALID [2022-04-08 04:01:09,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-08 04:01:09,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-08 04:01:09,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-08 04:01:09,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#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; {725#true} is VALID [2022-04-08 04:01:09,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-08 04:01:09,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {751#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:09,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(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; {755#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:09,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(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; {759#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-08 04:01:09,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(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; {763#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-08 04:01:09,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(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; {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:09,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10) 0) (= (+ (- 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; {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:09,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#(and (= (+ main_~main__sum~0 15 (* (- 5) main_~main__i~0)) 0) (= (+ (- 5) 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; {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} is VALID [2022-04-08 04:01:09,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#(and (= 7 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:01:09,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(and (= 0 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 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; {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} is VALID [2022-04-08 04:01:09,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(and (= (+ main_~main__sum~0 (- 36)) 0) (<= 8 main_~main__n~0) (<= main_~main__i~0 9))} 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; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:09,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-08 04:01:09,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-08 04:01:09,771 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-08 04:01:09,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:11,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {726#false} assume !false; {726#false} is VALID [2022-04-08 04:01:11,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {726#false} is VALID [2022-04-08 04:01:11,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(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; {787#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:11,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {800#(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-08 04:01:11,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {804#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:11,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#true} assume !!(1 <= ~main__n~0); {725#true} is VALID [2022-04-08 04:01:11,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {725#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; {725#true} is VALID [2022-04-08 04:01:11,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret5 := main(); {725#true} is VALID [2022-04-08 04:01:11,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #58#return; {725#true} is VALID [2022-04-08 04:01:11,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2022-04-08 04:01:11,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#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_96~0 := 0; {725#true} is VALID [2022-04-08 04:01:11,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2022-04-08 04:01:11,080 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-08 04:01:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992263799] [2022-04-08 04:01:11,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136580085] [2022-04-08 04:01:11,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136580085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:11,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:11,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2022-04-08 04:01:11,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:11,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184023873] [2022-04-08 04:01:11,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184023873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:11,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:11,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 04:01:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137304914] [2022-04-08 04:01:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:11,082 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-08 04:01:11,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:11,083 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-08 04:01:11,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:11,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 04:01:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 04:01:11,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:01:11,104 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-08 04:01:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:11,334 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 04:01:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 04:01:11,335 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-08 04:01:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:11,335 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-08 04:01:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 04:01:11,336 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-08 04:01:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-08 04:01:11,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-08 04:01:11,359 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-08 04:01:11,360 INFO L225 Difference]: With dead ends: 24 [2022-04-08 04:01:11,361 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 04:01:11,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 04:01:11,362 INFO L913 BasicCegarLoop]: 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-08 04:01:11,362 INFO L914 BasicCegarLoop]: 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-08 04:01:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 04:01:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 04:01:11,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:11,375 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-08 04:01:11,375 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-08 04:01:11,375 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-08 04:01:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:11,377 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 04:01:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 04:01:11,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:11,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:11,377 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-08 04:01:11,378 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-08 04:01:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:11,379 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 04:01:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 04:01:11,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:11,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:11,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:11,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:11,379 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-08 04:01:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-08 04:01:11,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-08 04:01:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:11,380 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-08 04:01:11,381 INFO L479 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-08 04:01:11,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-08 04:01:11,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 04:01:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 04:01:11,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:11,404 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:11,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:11,607 WARN L460 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-08 04:01:11,608 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 7 times [2022-04-08 04:01:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504693947] [2022-04-08 04:01:11,609 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 46671777, now seen corresponding path program 8 times [2022-04-08 04:01:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941105924] [2022-04-08 04:01:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:11,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:11,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234376694] [2022-04-08 04:01:11,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:11,743 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 04:01:11,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:11,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:11,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 04:01:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:11,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:12,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-08 04:01:12,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#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_96~0 := 0; {986#true} is VALID [2022-04-08 04:01:12,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-08 04:01:12,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-08 04:01:12,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-08 04:01:12,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#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; {986#true} is VALID [2022-04-08 04:01:12,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-08 04:01:12,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1012#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:12,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1012#(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; {1016#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:12,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(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; {1020#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:01:12,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {1020#(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; {1024#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:12,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#(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; {1028#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 04:01:12,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {1028#(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; {1032#(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-08 04:01:12,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(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; {1036#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-08 04:01:12,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {1036#(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; {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:01:12,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {1040#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 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; {1044#(and (= (* 4 main_~main__i~0) main_~main__sum~0) (= 5 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:01:12,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1044#(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; {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 10))} is VALID [2022-04-08 04:01:12,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(and (= (+ (- 9) main_~main__sum~0) 36) (<= 9 main_~main__n~0) (<= main_~main__i~0 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; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:12,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-08 04:01:12,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-08 04:01:12,220 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-08 04:01:12,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:13,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#false} assume !false; {987#false} is VALID [2022-04-08 04:01:13,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {987#false} is VALID [2022-04-08 04:01:13,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {1065#(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; {1052#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:13,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1065#(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-08 04:01:13,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1069#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:13,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#true} assume !!(1 <= ~main__n~0); {986#true} is VALID [2022-04-08 04:01:13,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {986#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; {986#true} is VALID [2022-04-08 04:01:13,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret5 := main(); {986#true} is VALID [2022-04-08 04:01:13,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #58#return; {986#true} is VALID [2022-04-08 04:01:13,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2022-04-08 04:01:13,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#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_96~0 := 0; {986#true} is VALID [2022-04-08 04:01:13,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2022-04-08 04:01:13,673 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-08 04:01:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941105924] [2022-04-08 04:01:13,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234376694] [2022-04-08 04:01:13,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234376694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:13,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:13,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2022-04-08 04:01:13,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504693947] [2022-04-08 04:01:13,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504693947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:13,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:13,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 04:01:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276330628] [2022-04-08 04:01:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:13,675 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-08 04:01:13,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:13,675 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-08 04:01:13,702 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-08 04:01:13,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 04:01:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 04:01:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-08 04:01:13,704 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-08 04:01:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:14,027 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 04:01:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 04:01:14,028 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-08 04:01:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:14,028 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-08 04:01:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-08 04:01:14,029 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-08 04:01:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2022-04-08 04:01:14,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 25 transitions. [2022-04-08 04:01:14,054 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-08 04:01:14,055 INFO L225 Difference]: With dead ends: 25 [2022-04-08 04:01:14,055 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 04:01:14,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:01:14,056 INFO L913 BasicCegarLoop]: 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-08 04:01:14,057 INFO L914 BasicCegarLoop]: 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-08 04:01:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 04:01:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 04:01:14,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:14,078 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-08 04:01:14,078 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-08 04:01:14,078 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-08 04:01:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:14,079 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 04:01:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 04:01:14,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:14,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:14,081 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-08 04:01:14,081 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-08 04:01:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:14,082 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 04:01:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 04:01:14,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:14,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:14,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:14,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:14,083 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-08 04:01:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 04:01:14,084 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-08 04:01:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:14,085 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 04:01:14,086 INFO L479 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-08 04:01:14,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 04:01:14,104 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-08 04:01:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 04:01:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:01:14,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:14,105 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:14,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:14,311 WARN L460 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-08 04:01:14,312 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 9 times [2022-04-08 04:01:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150218817] [2022-04-08 04:01:14,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1446762634, now seen corresponding path program 10 times [2022-04-08 04:01:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187713258] [2022-04-08 04:01:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:14,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:14,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858355392] [2022-04-08 04:01:14,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:01:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:14,383 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:14,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 04:01:14,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:01:14,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:14,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 04:01:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:14,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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_96~0 := 0; {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#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; {1260#true} is VALID [2022-04-08 04:01:14,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-08 04:01:14,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1286#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:14,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(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; {1290#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:14,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(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; {1294#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:01:14,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {1294#(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; {1298#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:14,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#(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; {1302#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 04:01:14,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {1302#(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; {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 04:01:14,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 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; {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:14,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 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; {1314#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 04:01:14,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {1314#(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; {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 12))))} is VALID [2022-04-08 04:01:14,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {1318#(and (= (+ (- 1) main_~main__i~0) 8) (= 15 (+ main_~main__sum~0 (* (- 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; {1322#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 04:01:14,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {1322#(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; {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} is VALID [2022-04-08 04:01:14,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {1326#(and (<= 10 main_~main__n~0) (<= main_~main__i~0 11) (= (+ main_~main__sum~0 (- 40)) 15))} 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; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:14,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-08 04:01:14,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 04:01:14,882 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-08 04:01:14,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:16,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 04:01:16,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1261#false} is VALID [2022-04-08 04:01:16,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#(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; {1330#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:16,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1343#(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-08 04:01:16,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1347#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:16,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(1 <= ~main__n~0); {1260#true} is VALID [2022-04-08 04:01:16,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#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; {1260#true} is VALID [2022-04-08 04:01:16,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret5 := main(); {1260#true} is VALID [2022-04-08 04:01:16,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #58#return; {1260#true} is VALID [2022-04-08 04:01:16,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 04:01:16,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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_96~0 := 0; {1260#true} is VALID [2022-04-08 04:01:16,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 04:01:16,484 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-08 04:01:16,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:16,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187713258] [2022-04-08 04:01:16,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:16,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858355392] [2022-04-08 04:01:16,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858355392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:16,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:16,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2022-04-08 04:01:16,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:16,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150218817] [2022-04-08 04:01:16,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150218817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:16,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:16,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:01:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897744441] [2022-04-08 04:01:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:16,486 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-08 04:01:16,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:16,487 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-08 04:01:16,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:16,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:01:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:01:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:01:16,508 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-08 04:01:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:16,814 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 04:01:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:01:16,814 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-08 04:01:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:16,815 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-08 04:01:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-08 04:01:16,816 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-08 04:01:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2022-04-08 04:01:16,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 26 transitions. [2022-04-08 04:01:16,851 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-08 04:01:16,852 INFO L225 Difference]: With dead ends: 26 [2022-04-08 04:01:16,852 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:01:16,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 04:01:16,853 INFO L913 BasicCegarLoop]: 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-08 04:01:16,853 INFO L914 BasicCegarLoop]: 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-08 04:01:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:01:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:01:16,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:16,869 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-08 04:01:16,870 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-08 04:01:16,870 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-08 04:01:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:16,871 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 04:01:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 04:01:16,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:16,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:16,871 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-08 04:01:16,871 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-08 04:01:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:16,872 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 04:01:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 04:01:16,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:16,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:16,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:16,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:16,873 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-08 04:01:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-08 04:01:16,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-08 04:01:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:16,874 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-08 04:01:16,874 INFO L479 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-08 04:01:16,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-08 04:01:16,900 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-08 04:01:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 04:01:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:01:16,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:16,901 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:16,929 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-08 04:01:17,115 WARN L460 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-08 04:01:17,115 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 11 times [2022-04-08 04:01:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:17,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322427881] [2022-04-08 04:01:17,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1899906241, now seen corresponding path program 12 times [2022-04-08 04:01:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:17,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347709783] [2022-04-08 04:01:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:17,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463074519] [2022-04-08 04:01:17,144 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:01:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:17,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:17,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 04:01:17,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:01:17,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 04:01:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:17,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:17,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#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_96~0 := 0; {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#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; {1547#true} is VALID [2022-04-08 04:01:17,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-08 04:01:17,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1573#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:17,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(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; {1577#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:01:17,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1577#(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; {1581#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 04:01:17,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1581#(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; {1585#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:17,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#(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; {1589#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 04:01:17,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {1589#(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; {1593#(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-08 04:01:17,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(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; {1597#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-08 04:01:17,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#(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; {1601#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:01:17,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#(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; {1605#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:17,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(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; {1609#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-08 04:01:17,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1609#(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; {1613#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:01:17,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1613#(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; {1617#(and (= 66 main_~main__sum~0) (<= main_~main__i~0 12) (<= 11 main_~main__n~0))} is VALID [2022-04-08 04:01:17,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#(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; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:17,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-08 04:01:17,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-08 04:01:17,609 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-08 04:01:17,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:19,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-04-08 04:01:19,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1548#false} is VALID [2022-04-08 04:01:19,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {1634#(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; {1621#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:19,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1634#(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-08 04:01:19,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1638#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:19,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume !!(1 <= ~main__n~0); {1547#true} is VALID [2022-04-08 04:01:19,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#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; {1547#true} is VALID [2022-04-08 04:01:19,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret5 := main(); {1547#true} is VALID [2022-04-08 04:01:19,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #58#return; {1547#true} is VALID [2022-04-08 04:01:19,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2022-04-08 04:01:19,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#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_96~0 := 0; {1547#true} is VALID [2022-04-08 04:01:19,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2022-04-08 04:01:19,300 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-08 04:01:19,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:19,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347709783] [2022-04-08 04:01:19,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:19,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463074519] [2022-04-08 04:01:19,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463074519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:19,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:19,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2022-04-08 04:01:19,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:19,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322427881] [2022-04-08 04:01:19,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322427881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:19,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:19,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 04:01:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891368562] [2022-04-08 04:01:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:19,302 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-08 04:01:19,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:19,302 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-08 04:01:19,324 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-08 04:01:19,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 04:01:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 04:01:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-08 04:01:19,325 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-08 04:01:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:19,705 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 04:01:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 04:01:19,706 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-08 04:01:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:19,706 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-08 04:01:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-08 04:01:19,707 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-08 04:01:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-04-08 04:01:19,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2022-04-08 04:01:19,734 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-08 04:01:19,735 INFO L225 Difference]: With dead ends: 27 [2022-04-08 04:01:19,735 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 04:01:19,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:01:19,736 INFO L913 BasicCegarLoop]: 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-08 04:01:19,736 INFO L914 BasicCegarLoop]: 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-08 04:01:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 04:01:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 04:01:19,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:19,754 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-08 04:01:19,754 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-08 04:01:19,754 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-08 04:01:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:19,755 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 04:01:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 04:01:19,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:19,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:19,756 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-08 04:01:19,756 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-08 04:01:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:19,757 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 04:01:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 04:01:19,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:19,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:19,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:19,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:19,757 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-08 04:01:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 04:01:19,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-08 04:01:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:19,758 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 04:01:19,759 INFO L479 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-08 04:01:19,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 04:01:19,784 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-08 04:01:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 04:01:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 04:01:19,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:19,785 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:19,806 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-08 04:01:19,999 WARN L460 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-08 04:01:19,999 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 13 times [2022-04-08 04:01:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:20,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [381375164] [2022-04-08 04:01:20,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1232511126, now seen corresponding path program 14 times [2022-04-08 04:01:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:20,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497500963] [2022-04-08 04:01:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:20,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664770993] [2022-04-08 04:01:20,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:20,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:20,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 04:01:20,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:20,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:20,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 04:01:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:20,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:20,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-08 04:01:20,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#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_96~0 := 0; {1847#true} is VALID [2022-04-08 04:01:20,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-08 04:01:20,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-08 04:01:20,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-08 04:01:20,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#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; {1847#true} is VALID [2022-04-08 04:01:20,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-08 04:01:20,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1873#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:20,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(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; {1877#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:01:20,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(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; {1881#(and (= main_~main__sum~0 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 2))} is VALID [2022-04-08 04:01:20,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {1881#(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; {1885#(and (= 2 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 2))))} is VALID [2022-04-08 04:01:20,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {1885#(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; {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:20,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {1889#(and (= 2 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ 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; {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:01:20,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1893#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 6))) (= 2 (+ (- 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; {1897#(and (= 6 (+ main_~main__sum~0 (- 15))) (= 7 main_~main__i~0))} is VALID [2022-04-08 04:01:20,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(and (= 6 (+ main_~main__sum~0 (- 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; {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:01:20,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1901#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 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; {1905#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 18)) (= 7 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:01:20,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1905#(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; {1909#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:20,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1909#(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; {1913#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 04:01:20,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1913#(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; {1917#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 04:01:20,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1917#(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; {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} is VALID [2022-04-08 04:01:20,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1921#(and (<= main_~main__i~0 13) (<= 12 main_~main__n~0) (= main_~main__sum~0 78))} 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; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:20,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-08 04:01:20,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-08 04:01:20,574 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-08 04:01:20,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:22,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2022-04-08 04:01:22,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {1848#false} is VALID [2022-04-08 04:01:22,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {1938#(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; {1925#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:22,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(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-08 04:01:22,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {1942#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:22,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(1 <= ~main__n~0); {1847#true} is VALID [2022-04-08 04:01:22,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {1847#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; {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret5 := main(); {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #58#return; {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1847#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_96~0 := 0; {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2022-04-08 04:01:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 04:01:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497500963] [2022-04-08 04:01:22,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664770993] [2022-04-08 04:01:22,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664770993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:22,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:22,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 18 [2022-04-08 04:01:22,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:22,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [381375164] [2022-04-08 04:01:22,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [381375164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:22,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:22,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 04:01:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231560296] [2022-04-08 04:01:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:22,468 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-08 04:01:22,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:22,468 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-08 04:01:22,490 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-08 04:01:22,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 04:01:22,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 04:01:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-08 04:01:22,491 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-08 04:01:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:22,896 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 04:01:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 04:01:22,896 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-08 04:01:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:22,897 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-08 04:01:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-08 04:01:22,898 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-08 04:01:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2022-04-08 04:01:22,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 28 transitions. [2022-04-08 04:01:22,933 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-08 04:01:22,934 INFO L225 Difference]: With dead ends: 28 [2022-04-08 04:01:22,934 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 04:01:22,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:01:22,934 INFO L913 BasicCegarLoop]: 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-08 04:01:22,935 INFO L914 BasicCegarLoop]: 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-08 04:01:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 04:01:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 04:01:22,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:22,953 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-08 04:01:22,954 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-08 04:01:22,954 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-08 04:01:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:22,955 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 04:01:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:01:22,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:22,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:22,955 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-08 04:01:22,956 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-08 04:01:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:22,956 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 04:01:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:01:22,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:22,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:22,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:22,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:22,957 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-08 04:01:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-08 04:01:22,958 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-08 04:01:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:22,958 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-08 04:01:22,958 INFO L479 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-08 04:01:22,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-08 04:01:22,986 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-08 04:01:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 04:01:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:01:22,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:22,987 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:23,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:23,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 04:01:23,187 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 15 times [2022-04-08 04:01:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620273674] [2022-04-08 04:01:23,188 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 446798305, now seen corresponding path program 16 times [2022-04-08 04:01:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709402610] [2022-04-08 04:01:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:23,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:23,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992456695] [2022-04-08 04:01:23,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:01:23,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:23,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:23,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 04:01:23,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:01:23,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:23,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 04:01:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:23,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:23,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-08 04:01:23,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#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_96~0 := 0; {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#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; {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-08 04:01:23,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2186#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:23,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2186#(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; {2190#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:01:23,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(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; {2194#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:01:23,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {2194#(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; {2198#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:23,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {2198#(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; {2202#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:01:23,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {2202#(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; {2206#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 04:01:23,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {2206#(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; {2210#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 04:01:23,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#(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; {2214#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:01:23,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#(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; {2218#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-08 04:01:23,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(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; {2222#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:23,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {2222#(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; {2226#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:01:23,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(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; {2230#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:01:23,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {2230#(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; {2234#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:01:23,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#(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; {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 13 main_~main__n~0) (<= main_~main__i~0 14))} is VALID [2022-04-08 04:01:23,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {2238#(and (= (+ (- 13) main_~main__sum~0) 78) (<= 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; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:23,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-08 04:01:23,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-08 04:01:23,667 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-08 04:01:23,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:25,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#false} assume !false; {2161#false} is VALID [2022-04-08 04:01:25,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2161#false} is VALID [2022-04-08 04:01:25,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#(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; {2242#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:25,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2255#(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-08 04:01:25,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2259#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:25,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#true} assume !!(1 <= ~main__n~0); {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {2160#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; {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {2160#true} call #t~ret5 := main(); {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2160#true} {2160#true} #58#return; {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {2160#true} assume true; {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {2160#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_96~0 := 0; {2160#true} is VALID [2022-04-08 04:01:25,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {2160#true} call ULTIMATE.init(); {2160#true} is VALID [2022-04-08 04:01:25,779 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-08 04:01:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709402610] [2022-04-08 04:01:25,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992456695] [2022-04-08 04:01:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992456695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:25,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 19 [2022-04-08 04:01:25,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620273674] [2022-04-08 04:01:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620273674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:25,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 04:01:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284098072] [2022-04-08 04:01:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:25,781 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-08 04:01:25,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:25,781 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-08 04:01:25,801 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-08 04:01:25,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 04:01:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 04:01:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:01:25,802 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-08 04:01:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:26,234 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 04:01:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 04:01:26,235 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-08 04:01:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:26,235 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-08 04:01:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-08 04:01:26,236 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-08 04:01:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2022-04-08 04:01:26,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 29 transitions. [2022-04-08 04:01:26,261 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-08 04:01:26,262 INFO L225 Difference]: With dead ends: 29 [2022-04-08 04:01:26,262 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 04:01:26,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 04:01:26,263 INFO L913 BasicCegarLoop]: 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-08 04:01:26,263 INFO L914 BasicCegarLoop]: 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-08 04:01:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 04:01:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 04:01:26,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:26,287 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-08 04:01:26,287 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-08 04:01:26,287 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-08 04:01:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:26,288 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 04:01:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 04:01:26,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:26,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:26,289 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-08 04:01:26,289 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-08 04:01:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:26,290 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 04:01:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 04:01:26,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:26,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:26,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:26,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:26,290 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-08 04:01:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-08 04:01:26,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-08 04:01:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:26,291 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-08 04:01:26,291 INFO L479 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-08 04:01:26,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-08 04:01:26,320 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-08 04:01:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 04:01:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 04:01:26,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:26,321 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:26,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:26,521 WARN L460 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-08 04:01:26,521 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 17 times [2022-04-08 04:01:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1547466647] [2022-04-08 04:01:26,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 965783114, now seen corresponding path program 18 times [2022-04-08 04:01:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361306906] [2022-04-08 04:01:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:26,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:26,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299330418] [2022-04-08 04:01:26,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:01:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:26,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:26,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 04:01:26,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 04:01:26,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:26,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 04:01:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:26,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:26,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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_96~0 := 0; {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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; {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-08 04:01:26,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2512#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:26,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {2512#(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; {2516#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:01:26,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#(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; {2520#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:01:26,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {2520#(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; {2524#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:26,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#(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; {2528#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-08 04:01:26,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {2528#(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; {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 04:01:26,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 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; {2536#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 04:01:26,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#(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; {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:01:26,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(and (= main_~main__sum~0 (+ 20 main_~main__i~0)) (= (+ (- 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; {2544#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:26,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(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; {2548#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:26,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#(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; {2552#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:01:26,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {2552#(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; {2556#(and (= 45 (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:26,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {2556#(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; {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~0)) 45))} is VALID [2022-04-08 04:01:26,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {2560#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (- 7) (* (- 2) main_~main__i~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; {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:01:26,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {2564#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 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; {2568#(and (= main_~main__sum~0 105) (<= main_~main__i~0 15) (<= 14 main_~main__n~0))} is VALID [2022-04-08 04:01:26,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {2568#(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; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:26,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-08 04:01:26,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 04:01:26,961 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-08 04:01:26,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:29,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-04-08 04:01:29,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2487#false} is VALID [2022-04-08 04:01:29,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {2585#(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; {2572#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:29,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2585#(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-08 04:01:29,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2589#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:29,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#true} assume !!(1 <= ~main__n~0); {2486#true} is VALID [2022-04-08 04:01:29,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#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; {2486#true} is VALID [2022-04-08 04:01:29,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {2486#true} call #t~ret5 := main(); {2486#true} is VALID [2022-04-08 04:01:29,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2486#true} {2486#true} #58#return; {2486#true} is VALID [2022-04-08 04:01:29,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#true} assume true; {2486#true} is VALID [2022-04-08 04:01:29,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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_96~0 := 0; {2486#true} is VALID [2022-04-08 04:01:29,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2022-04-08 04:01:29,129 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-08 04:01:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361306906] [2022-04-08 04:01:29,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299330418] [2022-04-08 04:01:29,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299330418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:29,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:29,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 20 [2022-04-08 04:01:29,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1547466647] [2022-04-08 04:01:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1547466647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:29,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:01:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954343817] [2022-04-08 04:01:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:29,130 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-08 04:01:29,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:29,131 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-08 04:01:29,154 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-08 04:01:29,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:01:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:01:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-08 04:01:29,155 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-08 04:01:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:29,779 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 04:01:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:01:29,779 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-08 04:01:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:29,780 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-08 04:01:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-08 04:01:29,781 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-08 04:01:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2022-04-08 04:01:29,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 30 transitions. [2022-04-08 04:01:29,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:29,816 INFO L225 Difference]: With dead ends: 30 [2022-04-08 04:01:29,816 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:01:29,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 04:01:29,817 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:29,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:01:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:01:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 04:01:29,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:29,869 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-08 04:01:29,869 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-08 04:01:29,870 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-08 04:01:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:29,870 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 04:01:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 04:01:29,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:29,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:29,871 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-08 04:01:29,871 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-08 04:01:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:29,872 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 04:01:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 04:01:29,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:29,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:29,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:29,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:29,872 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-08 04:01:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-08 04:01:29,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-08 04:01:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:29,873 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-08 04:01:29,873 INFO L479 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-08 04:01:29,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-08 04:01:29,915 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-08 04:01:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 04:01:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 04:01:29,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:29,915 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:29,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:30,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 04:01:30,116 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 19 times [2022-04-08 04:01:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:30,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442537758] [2022-04-08 04:01:30,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -125556991, now seen corresponding path program 20 times [2022-04-08 04:01:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:30,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148077319] [2022-04-08 04:01:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:30,131 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920611945] [2022-04-08 04:01:30,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:30,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:30,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:30,133 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:30,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 04:01:30,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:30,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:30,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 04:01:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:30,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:30,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#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_96~0 := 0; {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#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; {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-08 04:01:30,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2851#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:30,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {2851#(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; {2855#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:30,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(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; {2859#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:01:30,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {2859#(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; {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:01:30,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {2863#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 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; {2867#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:01:30,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#(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; {2871#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-08 04:01:30,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {2871#(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; {2875#(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-08 04:01:30,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {2875#(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; {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 5 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:01:30,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {2879#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 4)) (= 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; {2883#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:30,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {2883#(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; {2887#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:30,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {2887#(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; {2891#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:30,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {2891#(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; {2895#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 04:01:30,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {2895#(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; {2899#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-08 04:01:30,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#(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; {2903#(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-08 04:01:30,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#(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; {2907#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:01:30,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {2907#(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; {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 15 main_~main__n~0))} is VALID [2022-04-08 04:01:30,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {2911#(and (<= main_~main__i~0 16) (= main_~main__sum~0 120) (<= 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; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:30,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-08 04:01:30,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-08 04:01:30,607 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-08 04:01:30,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:33,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#false} assume !false; {2826#false} is VALID [2022-04-08 04:01:33,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {2826#false} is VALID [2022-04-08 04:01:33,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {2928#(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; {2915#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:33,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2928#(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-08 04:01:33,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {2825#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {2932#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:33,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {2825#true} assume !!(1 <= ~main__n~0); {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {2825#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; {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {2825#true} call #t~ret5 := main(); {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2825#true} {2825#true} #58#return; {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {2825#true} assume true; {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2825#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_96~0 := 0; {2825#true} is VALID [2022-04-08 04:01:33,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {2825#true} call ULTIMATE.init(); {2825#true} is VALID [2022-04-08 04:01:33,149 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-08 04:01:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148077319] [2022-04-08 04:01:33,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920611945] [2022-04-08 04:01:33,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920611945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:33,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:33,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 21 [2022-04-08 04:01:33,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442537758] [2022-04-08 04:01:33,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442537758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:33,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:33,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 04:01:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622374651] [2022-04-08 04:01:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:33,151 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-08 04:01:33,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:33,151 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-08 04:01:33,173 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-08 04:01:33,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 04:01:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 04:01:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-08 04:01:33,174 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-08 04:01:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:33,783 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 04:01:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 04:01:33,783 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-08 04:01:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:33,784 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-08 04:01:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-08 04:01:33,787 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-08 04:01:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2022-04-08 04:01:33,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 31 transitions. [2022-04-08 04:01:33,825 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-08 04:01:33,825 INFO L225 Difference]: With dead ends: 31 [2022-04-08 04:01:33,825 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 04:01:33,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:01:33,826 INFO L913 BasicCegarLoop]: 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-08 04:01:33,826 INFO L914 BasicCegarLoop]: 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-08 04:01:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 04:01:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 04:01:33,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:33,849 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-08 04:01:33,849 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-08 04:01:33,849 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-08 04:01:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:33,850 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 04:01:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 04:01:33,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:33,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:33,850 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-08 04:01:33,850 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-08 04:01:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:33,851 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 04:01:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 04:01:33,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:33,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:33,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:33,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:33,851 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-08 04:01:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-08 04:01:33,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-08 04:01:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:33,853 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-08 04:01:33,853 INFO L479 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-08 04:01:33,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-08 04:01:33,886 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-08 04:01:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 04:01:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 04:01:33,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:33,887 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:33,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:34,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 04:01:34,091 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 21 times [2022-04-08 04:01:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505154445] [2022-04-08 04:01:34,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash 402638122, now seen corresponding path program 22 times [2022-04-08 04:01:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:34,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171176870] [2022-04-08 04:01:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:34,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:34,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442342143] [2022-04-08 04:01:34,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:01:34,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:34,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:34,127 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:34,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 04:01:34,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:01:34,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:34,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 04:01:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:34,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:34,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-08 04:01:34,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#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_96~0 := 0; {3177#true} is VALID [2022-04-08 04:01:34,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-08 04:01:34,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-08 04:01:34,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-08 04:01:34,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#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; {3177#true} is VALID [2022-04-08 04:01:34,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-08 04:01:34,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3203#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:34,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {3203#(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; {3207#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:34,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(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; {3211#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:01:34,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#(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; {3215#(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-08 04:01:34,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {3215#(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; {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:34,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {3219#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) (- 7))) (= (+ (- 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; {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 5 main_~main__i~0))))} is VALID [2022-04-08 04:01:34,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3223#(and (= (+ (- 5) main_~main__i~0) 1) (= main_~main__sum~0 (+ (- 15) (* 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; {3227#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-08 04:01:34,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3227#(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; {3231#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:01:34,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3231#(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; {3235#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:34,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {3235#(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; {3239#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:34,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(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; {3243#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 04:01:34,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {3243#(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; {3247#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:01:34,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {3247#(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; {3251#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 04:01:34,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(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; {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:01:34,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {3255#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 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; {3259#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:01:34,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {3259#(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; {3263#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 105))} is VALID [2022-04-08 04:01:34,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {3263#(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; {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 16 main_~main__n~0) (<= main_~main__i~0 17))} is VALID [2022-04-08 04:01:34,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(and (= (+ main_~main__sum~0 (- 31)) 105) (<= 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; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:34,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-08 04:01:34,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-08 04:01:34,717 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-08 04:01:34,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:37,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2022-04-08 04:01:37,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3178#false} is VALID [2022-04-08 04:01:37,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {3284#(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; {3271#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:37,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3284#(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-08 04:01:37,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {3177#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3288#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:37,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {3177#true} assume !!(1 <= ~main__n~0); {3177#true} is VALID [2022-04-08 04:01:37,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3177#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; {3177#true} is VALID [2022-04-08 04:01:37,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {3177#true} call #t~ret5 := main(); {3177#true} is VALID [2022-04-08 04:01:37,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #58#return; {3177#true} is VALID [2022-04-08 04:01:37,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2022-04-08 04:01:37,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {3177#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_96~0 := 0; {3177#true} is VALID [2022-04-08 04:01:37,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2022-04-08 04:01:37,361 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-08 04:01:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:37,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171176870] [2022-04-08 04:01:37,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:37,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442342143] [2022-04-08 04:01:37,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442342143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:37,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5] total 22 [2022-04-08 04:01:37,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505154445] [2022-04-08 04:01:37,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505154445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:37,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:37,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 04:01:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049376496] [2022-04-08 04:01:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:37,362 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-08 04:01:37,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:37,363 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-08 04:01:37,387 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-08 04:01:37,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 04:01:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 04:01:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:01:37,388 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-08 04:01:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:38,107 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 04:01:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 04:01:38,107 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-08 04:01:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:38,107 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-08 04:01:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-08 04:01:38,108 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-08 04:01:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2022-04-08 04:01:38,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 32 transitions. [2022-04-08 04:01:38,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:38,162 INFO L225 Difference]: With dead ends: 32 [2022-04-08 04:01:38,162 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 04:01:38,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:01:38,163 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:38,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:01:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 04:01:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 04:01:38,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:38,193 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-08 04:01:38,193 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-08 04:01:38,193 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-08 04:01:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:38,194 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 04:01:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 04:01:38,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:38,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:38,195 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-08 04:01:38,195 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-08 04:01:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:38,196 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-08 04:01:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 04:01:38,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:38,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:38,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:38,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:38,196 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-08 04:01:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-08 04:01:38,197 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-08 04:01:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:38,197 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-08 04:01:38,197 INFO L479 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-08 04:01:38,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-08 04:01:38,234 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-08 04:01:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-08 04:01:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 04:01:38,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:38,235 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:38,262 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-08 04:01:38,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 04:01:38,436 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 23 times [2022-04-08 04:01:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178377255] [2022-04-08 04:01:38,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -403182559, now seen corresponding path program 24 times [2022-04-08 04:01:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:38,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50867696] [2022-04-08 04:01:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:38,455 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:38,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872339386] [2022-04-08 04:01:38,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:01:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:38,461 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:38,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 04:01:38,525 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 04:01:38,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:38,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-08 04:01:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:38,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:39,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-08 04:01:39,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#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_96~0 := 0; {3542#true} is VALID [2022-04-08 04:01:39,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-08 04:01:39,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-08 04:01:39,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-08 04:01:39,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#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; {3542#true} is VALID [2022-04-08 04:01:39,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-08 04:01:39,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3568#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:39,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#(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; {3572#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:01:39,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {3572#(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; {3576#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 04:01:39,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {3576#(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; {3580#(and (= (+ main_~main__sum~0 (- 6)) 0) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:01:39,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(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; {3584#(and (= (+ (- 1) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 0))} is VALID [2022-04-08 04:01:39,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {3584#(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; {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 04:01:39,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 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; {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:39,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {3592#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 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; {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) main_~main__i~0) 4))} is VALID [2022-04-08 04:01:39,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {3596#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 4))) (= (+ (- 4) 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; {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:39,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {3600#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ (* 4 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; {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 04:01:39,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {3604#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:01:39,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {3608#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 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; {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:39,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {3612#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 26)) 28) (= (+ (- 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; {3616#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-08 04:01:39,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {3616#(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; {3620#(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-08 04:01:39,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {3620#(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; {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 4) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:39,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {3624#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ (* 2 main_~main__i~0) 48)) (= (+ (- 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; {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 5 main_~main__i~0))))} is VALID [2022-04-08 04:01:39,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {3628#(and (= (+ (- 5) main_~main__i~0) 11) (= main_~main__sum~0 (+ 40 (* 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; {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:39,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {3632#(and (= (+ 35 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) 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; {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} is VALID [2022-04-08 04:01:39,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {3636#(and (<= 17 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120) (<= main_~main__i~0 18))} 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; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:39,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-08 04:01:39,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-08 04:01:39,043 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-08 04:01:39,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:41,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {3543#false} assume !false; {3543#false} is VALID [2022-04-08 04:01:41,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3543#false} is VALID [2022-04-08 04:01:41,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {3653#(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; {3640#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:41,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3653#(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-08 04:01:42,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3657#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:42,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#true} assume !!(1 <= ~main__n~0); {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#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; {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {3542#true} call #t~ret5 := main(); {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3542#true} {3542#true} #58#return; {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {3542#true} assume true; {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#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_96~0 := 0; {3542#true} is VALID [2022-04-08 04:01:42,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {3542#true} call ULTIMATE.init(); {3542#true} is VALID [2022-04-08 04:01:42,053 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-08 04:01:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50867696] [2022-04-08 04:01:42,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872339386] [2022-04-08 04:01:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872339386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:42,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:42,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 23 [2022-04-08 04:01:42,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178377255] [2022-04-08 04:01:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178377255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:42,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:42,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 04:01:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880750505] [2022-04-08 04:01:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:42,054 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-08 04:01:42,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:42,054 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-08 04:01:42,078 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-08 04:01:42,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 04:01:42,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 04:01:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-08 04:01:42,079 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-08 04:01:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:42,819 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 04:01:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 04:01:42,820 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-08 04:01:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:42,820 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-08 04:01:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-08 04:01:42,821 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-08 04:01:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2022-04-08 04:01:42,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 33 transitions. [2022-04-08 04:01:42,852 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-08 04:01:42,853 INFO L225 Difference]: With dead ends: 33 [2022-04-08 04:01:42,853 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 04:01:42,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:01:42,854 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-08 04:01:42,854 INFO L914 BasicCegarLoop]: 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-08 04:01:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 04:01:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 04:01:42,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:42,879 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-08 04:01:42,879 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-08 04:01:42,879 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-08 04:01:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:42,880 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 04:01:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 04:01:42,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:42,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:42,880 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-08 04:01:42,880 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-08 04:01:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:42,881 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 04:01:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 04:01:42,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:42,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:42,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:42,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:42,882 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-08 04:01:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-08 04:01:42,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-08 04:01:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:42,883 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-08 04:01:42,883 INFO L479 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-08 04:01:42,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-08 04:01:42,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-08 04:01:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 04:01:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 04:01:42,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:42,919 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:42,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 04:01:43,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 04:01:43,120 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 25 times [2022-04-08 04:01:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671203310] [2022-04-08 04:01:43,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 386180106, now seen corresponding path program 26 times [2022-04-08 04:01:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:43,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217589301] [2022-04-08 04:01:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:43,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705852219] [2022-04-08 04:01:43,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:43,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:43,145 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:43,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 04:01:43,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:43,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:43,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-08 04:01:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:43,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-08 04:01:43,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#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_96~0 := 0; {3920#true} is VALID [2022-04-08 04:01:43,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-08 04:01:43,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-08 04:01:43,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-08 04:01:43,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#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; {3920#true} is VALID [2022-04-08 04:01:43,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-08 04:01:43,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {3946#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:43,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {3946#(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; {3950#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:01:43,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {3950#(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; {3954#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:01:43,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {3954#(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; {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-08 04:01:43,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#(and (= (+ (- 3) main_~main__i~0) 1) (= 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; {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:43,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {3962#(and (= (+ (- 9) (* 3 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {3966#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 04:01:43,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {3966#(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; {3970#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 04:01:43,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {3970#(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; {3974#(and (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:01:43,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {3974#(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; {3978#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:43,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {3978#(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; {3982#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:01:43,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {3982#(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; {3986#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:43,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {3986#(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; {3990#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 04:01:43,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {3990#(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; {3994#(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-08 04:01:43,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {3994#(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; {3998#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 35)) (= (+ (- 4) main_~main__i~0) 10))} is VALID [2022-04-08 04:01:43,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {3998#(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; {4002#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:01:43,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {4002#(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; {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-08 04:01:43,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {4006#(and (= 105 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:01:43,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {4010#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 105) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} is VALID [2022-04-08 04:01:43,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {4014#(and (= 18 main_~main__i~0) (= (+ (- 48) main_~main__sum~0) 105))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 main_~main__n~0))} is VALID [2022-04-08 04:01:43,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {4018#(and (= (+ main_~main__sum~0 (- 66)) 105) (<= main_~main__i~0 19) (<= 18 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; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:43,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-08 04:01:43,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-08 04:01:43,747 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-08 04:01:43,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:46,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-04-08 04:01:46,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {3921#false} is VALID [2022-04-08 04:01:46,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {4035#(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; {4022#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:46,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4035#(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-08 04:01:46,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3920#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4039#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:47,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume !!(1 <= ~main__n~0); {3920#true} is VALID [2022-04-08 04:01:47,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#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; {3920#true} is VALID [2022-04-08 04:01:47,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {3920#true} call #t~ret5 := main(); {3920#true} is VALID [2022-04-08 04:01:47,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3920#true} {3920#true} #58#return; {3920#true} is VALID [2022-04-08 04:01:47,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume true; {3920#true} is VALID [2022-04-08 04:01:47,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#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_96~0 := 0; {3920#true} is VALID [2022-04-08 04:01:47,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {3920#true} call ULTIMATE.init(); {3920#true} is VALID [2022-04-08 04:01:47,096 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-08 04:01:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:47,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217589301] [2022-04-08 04:01:47,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:47,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705852219] [2022-04-08 04:01:47,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705852219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:47,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:47,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 24 [2022-04-08 04:01:47,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:47,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671203310] [2022-04-08 04:01:47,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671203310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:47,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:47,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 04:01:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304941470] [2022-04-08 04:01:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:47,098 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-08 04:01:47,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:47,098 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-08 04:01:47,132 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-08 04:01:47,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 04:01:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 04:01:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-04-08 04:01:47,133 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-08 04:01:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:48,007 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 04:01:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 04:01:48,007 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-08 04:01:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:48,007 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-08 04:01:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-08 04:01:48,008 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-08 04:01:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2022-04-08 04:01:48,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 34 transitions. [2022-04-08 04:01:48,049 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-08 04:01:48,050 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:01:48,050 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 04:01:48,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-08 04:01:48,051 INFO L913 BasicCegarLoop]: 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-08 04:01:48,051 INFO L914 BasicCegarLoop]: 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-08 04:01:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 04:01:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 04:01:48,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:48,083 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-08 04:01:48,083 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-08 04:01:48,083 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-08 04:01:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:48,084 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 04:01:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 04:01:48,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:48,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:48,084 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-08 04:01:48,084 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-08 04:01:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:48,085 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 04:01:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 04:01:48,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:48,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:48,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:48,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:48,085 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-08 04:01:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 04:01:48,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-08 04:01:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:48,086 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 04:01:48,086 INFO L479 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-08 04:01:48,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 04:01:48,130 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-08 04:01:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 04:01:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 04:01:48,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:48,130 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:48,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 04:01:48,331 WARN L460 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-08 04:01:48,331 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 27 times [2022-04-08 04:01:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712216178] [2022-04-08 04:01:48,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash -913381055, now seen corresponding path program 28 times [2022-04-08 04:01:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657940892] [2022-04-08 04:01:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:48,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500852768] [2022-04-08 04:01:48,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:01:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:48,374 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:48,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 04:01:48,432 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:01:48,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:48,436 WARN L261 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-08 04:01:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:48,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:49,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-08 04:01:49,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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_96~0 := 0; {4311#true} is VALID [2022-04-08 04:01:49,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-08 04:01:49,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-08 04:01:49,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-08 04:01:49,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#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; {4311#true} is VALID [2022-04-08 04:01:49,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-08 04:01:49,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4337#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:49,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#(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; {4341#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:49,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {4341#(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; {4345#(and (= (+ (- 2) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 0))} is VALID [2022-04-08 04:01:49,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(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; {4349#(and (= (+ (- 3) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 0))} is VALID [2022-04-08 04:01:49,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {4349#(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; {4353#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 04:01:49,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {4353#(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; {4357#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 04:01:49,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(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; {4361#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 04:01:49,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {4361#(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; {4365#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:01:49,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(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; {4369#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:49,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(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; {4373#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 04:01:49,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {4373#(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; {4377#(and (= (+ main_~main__sum~0 (- 19)) 36) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:01:49,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#(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; {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:49,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {4381#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 36) (= (+ (- 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; {4385#(and (= 13 main_~main__i~0) (= main_~main__sum~0 78))} is VALID [2022-04-08 04:01:49,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {4385#(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; {4389#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:01:49,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {4389#(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; {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:49,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {4393#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ 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; {4397#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:01:49,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {4397#(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; {4401#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:01:49,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {4401#(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; {4405#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:01:49,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {4405#(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; {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-08 04:01:49,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {4409#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 main_~main__n~0))} is VALID [2022-04-08 04:01:49,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {4413#(and (<= main_~main__i~0 20) (= 190 main_~main__sum~0) (<= 19 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; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:49,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-08 04:01:49,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-08 04:01:49,054 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-08 04:01:49,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:52,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-08 04:01:52,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4312#false} is VALID [2022-04-08 04:01:52,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {4430#(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; {4417#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:52,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4430#(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-08 04:01:52,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4434#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:01:52,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(1 <= ~main__n~0); {4311#true} is VALID [2022-04-08 04:01:52,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#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; {4311#true} is VALID [2022-04-08 04:01:52,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret5 := main(); {4311#true} is VALID [2022-04-08 04:01:52,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #58#return; {4311#true} is VALID [2022-04-08 04:01:52,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-08 04:01:52,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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_96~0 := 0; {4311#true} is VALID [2022-04-08 04:01:52,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-08 04:01:52,675 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-08 04:01:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:52,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657940892] [2022-04-08 04:01:52,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:52,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500852768] [2022-04-08 04:01:52,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500852768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:52,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:52,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 25 [2022-04-08 04:01:52,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:52,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712216178] [2022-04-08 04:01:52,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712216178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:52,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:52,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 04:01:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992349912] [2022-04-08 04:01:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:52,676 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-08 04:01:52,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:52,676 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-08 04:01:52,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:52,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 04:01:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 04:01:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2022-04-08 04:01:52,708 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-08 04:01:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:53,691 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 04:01:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 04:01:53,691 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-08 04:01:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:53,692 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-08 04:01:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-08 04:01:53,693 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-08 04:01:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-04-08 04:01:53,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 35 transitions. [2022-04-08 04:01:53,732 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-08 04:01:53,733 INFO L225 Difference]: With dead ends: 35 [2022-04-08 04:01:53,733 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:01:53,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 19 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-04-08 04:01:53,734 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:53,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:01:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:01:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:01:53,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:53,767 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-08 04:01:53,767 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-08 04:01:53,767 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-08 04:01:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:53,768 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 04:01:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 04:01:53,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:53,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:53,768 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-08 04:01:53,769 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-08 04:01:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:53,769 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 04:01:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 04:01:53,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:53,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:53,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:53,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:53,770 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-08 04:01:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-08 04:01:53,770 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-08 04:01:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:53,771 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-08 04:01:53,771 INFO L479 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-08 04:01:53,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-08 04:01:53,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:01:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-08 04:01:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 04:01:53,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:53,821 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:53,847 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-08 04:01:54,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 04:01:54,021 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:54,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 29 times [2022-04-08 04:01:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:54,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105757921] [2022-04-08 04:01:54,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1749895914, now seen corresponding path program 30 times [2022-04-08 04:01:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:54,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444364668] [2022-04-08 04:01:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:54,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987914948] [2022-04-08 04:01:54,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:01:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:54,051 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:54,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 04:01:54,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 04:01:54,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:54,109 WARN L261 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-08 04:01:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:54,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:54,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#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_96~0 := 0; {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#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; {4715#true} is VALID [2022-04-08 04:01:54,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4738#(<= 1 main_~main__n~0)} is VALID [2022-04-08 04:01:54,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {4738#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4742#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:54,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {4742#(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; {4746#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:01:54,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {4746#(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; {4750#(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-08 04:01:54,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {4750#(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; {4754#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:54,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {4754#(and (= main_~main__sum~0 6) (= 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; {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 4)) 6))} is VALID [2022-04-08 04:01:54,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (= 5 main_~main__i~0) (<= 1 main_~main__n~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; {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:54,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#(and (= 6 main_~main__i~0) (= (+ (- 9) main_~main__sum~0) 6) (<= 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; {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 8))))} is VALID [2022-04-08 04:01:54,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#(and (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0) (= 6 (+ main_~main__sum~0 (* (- 1) 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; {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} is VALID [2022-04-08 04:01:54,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(and (<= 1 main_~main__n~0) (= 6 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 6)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 1 main_~main__n~0) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:54,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(and (= 6 (+ main_~main__sum~0 (- 30))) (<= 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; {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:54,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {4778#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 6) (<= 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; {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} is VALID [2022-04-08 04:01:54,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {4782#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= (+ main_~main__sum~0 (- 49)) 6))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:01:54,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {4786#(and (= 6 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (<= 1 main_~main__n~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; {4790#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ (* 2 main_~main__i~0) 52) main_~main__sum~0))} is VALID [2022-04-08 04:01:54,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {4790#(and (<= 1 main_~main__n~0) (= (+ (- 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; {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 2 main_~main__i~0) 50) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:54,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {4794#(and (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0) (= (+ (* 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; {4798#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:01:54,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {4798#(and (<= 1 main_~main__n~0) (= (+ 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; {4802#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 (+ 104 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 15))} is VALID [2022-04-08 04:01:54,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {4802#(and (<= 1 main_~main__n~0) (= 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; {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:01:54,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {4806#(and (= (+ 103 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= 15 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-08 04:01:54,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#(and (= 18 main_~main__i~0) (<= 1 main_~main__n~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; {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 04:01:54,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {4814#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 32)) 120) (= (+ (- 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; {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:01:54,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {4818#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 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; {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} is VALID [2022-04-08 04:01:54,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {4822#(and (<= 20 main_~main__n~0) (<= main_~main__i~0 21) (= main_~main__sum~0 210))} 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; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:54,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-08 04:01:54,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-08 04:01:54,766 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-08 04:01:54,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:01:56,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {4716#false} assume !false; {4716#false} is VALID [2022-04-08 04:01:56,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {4716#false} is VALID [2022-04-08 04:01:56,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {4839#(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; {4826#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:56,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {4839#(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-08 04:01:56,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {4847#(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; {4843#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 04:01:56,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {4851#(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; {4847#(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-08 04:01:56,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {4855#(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; {4851#(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-08 04:01:56,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {4859#(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; {4855#(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-08 04:01:56,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {4863#(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; {4859#(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-08 04:01:56,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {4867#(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; {4863#(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-08 04:01:56,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#(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; {4867#(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-08 04:01:56,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {4875#(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; {4871#(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-08 04:01:56,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {4879#(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; {4875#(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-08 04:01:56,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {4883#(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; {4879#(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-08 04:01:56,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {4887#(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; {4883#(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-08 04:01:56,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {4891#(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; {4887#(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-08 04:01:56,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {4895#(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; {4891#(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-08 04:01:56,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {4899#(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; {4895#(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-08 04:01:56,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {4903#(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; {4899#(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-08 04:01:56,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {4907#(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; {4903#(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-08 04:01:56,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {4911#(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; {4907#(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-08 04:01:56,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {4915#(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; {4911#(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-08 04:01:56,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {4919#(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; {4915#(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-08 04:01:56,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {4715#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {4919#(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-08 04:01:56,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {4715#true} assume !!(1 <= ~main__n~0); {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {4715#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; {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {4715#true} call #t~ret5 := main(); {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4715#true} {4715#true} #58#return; {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {4715#true} assume true; {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {4715#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_96~0 := 0; {4715#true} is VALID [2022-04-08 04:01:56,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {4715#true} call ULTIMATE.init(); {4715#true} is VALID [2022-04-08 04:01:56,118 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-08 04:01:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:01:56,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444364668] [2022-04-08 04:01:56,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:01:56,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987914948] [2022-04-08 04:01:56,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987914948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:01:56,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:01:56,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2022-04-08 04:01:56,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:01:56,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105757921] [2022-04-08 04:01:56,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105757921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:01:56,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:01:56,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 04:01:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573602732] [2022-04-08 04:01:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:01:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:56,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:01:56,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:56,160 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-08 04:01:56,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 04:01:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 04:01:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1557, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 04:01:56,161 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:57,327 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 04:01:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 04:01:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-08 04:01:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-04-08 04:01:57,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 36 transitions. [2022-04-08 04:01:57,377 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-08 04:01:57,378 INFO L225 Difference]: With dead ends: 36 [2022-04-08 04:01:57,378 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 04:01:57,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=519, Invalid=1643, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 04:01:57,379 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 04:01:57,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 109 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 04:01:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 04:01:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 04:01:57,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:01:57,424 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-08 04:01:57,424 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-08 04:01:57,425 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-08 04:01:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:57,425 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 04:01:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 04:01:57,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:57,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:57,426 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-08 04:01:57,426 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-08 04:01:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:57,427 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 04:01:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 04:01:57,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:01:57,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:01:57,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:01:57,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:01:57,428 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-08 04:01:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-08 04:01:57,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-08 04:01:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:01:57,430 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-08 04:01:57,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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-08 04:01:57,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-08 04:01:57,484 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-08 04:01:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-08 04:01:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 04:01:57,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:01:57,484 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:01:57,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 04:01:57,685 WARN L460 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-08 04:01:57,685 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:01:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:01:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 31 times [2022-04-08 04:01:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:01:57,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590700726] [2022-04-08 04:01:57,686 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:01:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1587863967, now seen corresponding path program 32 times [2022-04-08 04:01:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:01:57,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731794841] [2022-04-08 04:01:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:01:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:01:57,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:01:57,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385200150] [2022-04-08 04:01:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:01:57,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:01:57,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:01:57,704 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:01:57,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 04:01:57,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:01:57,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:01:57,752 WARN L261 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 92 conjunts are in the unsatisfiable core [2022-04-08 04:01:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:01:57,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:01:58,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#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_96~0 := 0; {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#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; {5152#true} is VALID [2022-04-08 04:01:58,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-08 04:01:58,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5178#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:01:58,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {5178#(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; {5182#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:01:58,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {5182#(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; {5186#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:01:58,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {5186#(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; {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 1) main_~main__sum~0 (* (- 1) main_~main__i~0)) 1))} is VALID [2022-04-08 04:01:58,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {5190#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ (- 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; {5194#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:01:58,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(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; {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:58,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ 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; {5202#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 04:01:58,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {5202#(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; {5206#(and (= 7 (+ main_~main__sum~0 (- 21))) (= (+ (- 20) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:01:58,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {5206#(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; {5210#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:01:58,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {5210#(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; {5214#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 04:01:58,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {5214#(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; {5218#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:01:58,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {5218#(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; {5222#(and (= (+ (- 55) main_~main__sum~0) 11) (= (+ main_~main__sum~0 (- 54)) main_~main__i~0))} is VALID [2022-04-08 04:01:58,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {5222#(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; {5226#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:01:58,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {5226#(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; {5230#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-08 04:01:58,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {5230#(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; {5234#(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-08 04:01:58,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {5234#(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; {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-08 04:01:58,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {5238#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 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; {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-08 04:01:58,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {5242#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) 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; {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) main_~main__i~0) 12))} is VALID [2022-04-08 04:01:58,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {5246#(and (= (+ 46 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 6) 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; {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 04:01:58,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {5250#(and (= main_~main__sum~0 (+ 38 (* 7 main_~main__i~0))) (= 12 (+ (- 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; {5254#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:01:58,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {5254#(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; {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:01:58,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {5258#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ 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; {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 21 main_~main__n~0))} is VALID [2022-04-08 04:01:58,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {5262#(and (<= main_~main__i~0 22) (= 190 (+ main_~main__sum~0 (- 41))) (<= 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; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:01:58,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-08 04:01:58,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-08 04:01:58,309 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-08 04:01:58,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:02,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {5153#false} assume !false; {5153#false} is VALID [2022-04-08 04:02:02,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5153#false} is VALID [2022-04-08 04:02:02,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {5279#(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; {5266#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:02,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(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-08 04:02:02,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~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#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {5152#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5283#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:02,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {5152#true} assume !!(1 <= ~main__n~0); {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {5152#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; {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {5152#true} call #t~ret5 := main(); {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5152#true} {5152#true} #58#return; {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {5152#true} assume true; {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5152#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_96~0 := 0; {5152#true} is VALID [2022-04-08 04:02:02,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {5152#true} call ULTIMATE.init(); {5152#true} is VALID [2022-04-08 04:02:02,511 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-08 04:02:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:02,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731794841] [2022-04-08 04:02:02,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:02,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385200150] [2022-04-08 04:02:02,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385200150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:02,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:02,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5] total 27 [2022-04-08 04:02:02,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:02,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590700726] [2022-04-08 04:02:02,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590700726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:02,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:02,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 04:02:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655810659] [2022-04-08 04:02:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:02,512 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-08 04:02:02,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:02,513 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-08 04:02:02,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:02,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 04:02:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 04:02:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:02:02,551 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-08 04:02:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:03,992 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 04:02:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 04:02:03,992 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-08 04:02:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:03,992 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-08 04:02:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-08 04:02:03,993 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-08 04:02:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2022-04-08 04:02:03,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 37 transitions. [2022-04-08 04:02:04,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:04,032 INFO L225 Difference]: With dead ends: 37 [2022-04-08 04:02:04,032 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 04:02:04,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 21 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2022-04-08 04:02:04,033 INFO L913 BasicCegarLoop]: 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-08 04:02:04,033 INFO L914 BasicCegarLoop]: 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-08 04:02:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 04:02:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 04:02:04,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:04,067 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-08 04:02:04,067 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-08 04:02:04,067 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-08 04:02:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:04,068 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 04:02:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 04:02:04,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:04,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:04,068 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-08 04:02:04,068 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-08 04:02:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:04,069 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-08 04:02:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 04:02:04,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:04,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:04,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:04,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:04,070 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-08 04:02:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-08 04:02:04,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-08 04:02:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:04,070 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-08 04:02:04,071 INFO L479 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-08 04:02:04,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-08 04:02:04,120 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-08 04:02:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-08 04:02:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 04:02:04,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:04,120 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:04,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 04:02:04,323 WARN L460 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-08 04:02:04,323 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 33 times [2022-04-08 04:02:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:04,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422132449] [2022-04-08 04:02:04,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205174, now seen corresponding path program 34 times [2022-04-08 04:02:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:04,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847815274] [2022-04-08 04:02:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:04,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730727710] [2022-04-08 04:02:04,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:02:04,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:04,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:04,353 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:02:04,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 04:02:04,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:02:04,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:04,416 WARN L261 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-08 04:02:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:04,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:04,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 04:02:04,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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_96~0 := 0; {5582#true} is VALID [2022-04-08 04:02:04,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 04:02:04,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-08 04:02:04,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-08 04:02:04,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#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; {5582#true} is VALID [2022-04-08 04:02:04,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-08 04:02:04,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5608#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {5608#(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; {5612#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:02:04,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {5612#(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; {5616#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:02:04,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {5616#(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; {5620#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:02:04,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {5620#(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; {5624#(and (= 3 (+ (- 2) main_~main__i~0)) (= (* 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:02:05,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {5624#(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; {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:05,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {5628#(and (= 3 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 2)) (+ 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; {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:02:05,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {5632#(and (= 3 (+ (- 4) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) (- 4)) (+ 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; {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 6))))} is VALID [2022-04-08 04:02:05,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(and (= 3 (+ (- 5) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 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; {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)))} is VALID [2022-04-08 04:02:05,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {5640#(and (= (+ (- 6) main_~main__i~0) 3) (= (+ (* 2 main_~main__i~0) (- 8)) (+ 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; {5644#(and (= (+ main_~main__sum~0 (- 35)) 10) (= 10 main_~main__i~0))} is VALID [2022-04-08 04:02:05,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {5644#(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; {5648#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 04:02:05,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {5648#(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; {5652#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:02:05,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(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; {5656#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 04:02:05,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {5656#(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; {5660#(and (= (+ (- 1) main_~main__i~0) 13) (= 66 (+ (- 11) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:02:05,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {5660#(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; {5664#(and (= main_~main__sum~0 105) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:02:05,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {5664#(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; {5668#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:02:05,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {5668#(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; {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:02:05,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {5672#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {5676#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:02:05,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {5676#(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; {5680#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 04:02:05,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {5680#(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; {5684#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 04:02:05,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {5684#(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; {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-08 04:02:05,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {5688#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5692#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 04:02:05,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {5692#(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; {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} is VALID [2022-04-08 04:02:05,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {5696#(and (<= (+ main_~main__i~0 230) main_~main__sum~0) (<= main_~main__sum~0 (+ 231 main_~main__n~0)) (= (+ main_~main__sum~0 (- 231)) 22))} 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; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:05,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-08 04:02:05,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 04:02:05,012 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-08 04:02:05,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:09,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 04:02:09,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {5583#false} is VALID [2022-04-08 04:02:09,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(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; {5700#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:09,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5713#(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-08 04:02:09,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {5717#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:09,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {5582#true} assume !!(1 <= ~main__n~0); {5582#true} is VALID [2022-04-08 04:02:09,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#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; {5582#true} is VALID [2022-04-08 04:02:09,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#true} call #t~ret5 := main(); {5582#true} is VALID [2022-04-08 04:02:09,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#true} {5582#true} #58#return; {5582#true} is VALID [2022-04-08 04:02:09,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 04:02:09,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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_96~0 := 0; {5582#true} is VALID [2022-04-08 04:02:09,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 04:02:09,677 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-08 04:02:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847815274] [2022-04-08 04:02:09,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730727710] [2022-04-08 04:02:09,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730727710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:09,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:09,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 28 [2022-04-08 04:02:09,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:09,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422132449] [2022-04-08 04:02:09,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422132449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:09,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:09,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 04:02:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826066503] [2022-04-08 04:02:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:09,678 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-08 04:02:09,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:09,679 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-08 04:02:09,716 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-08 04:02:09,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 04:02:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 04:02:09,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2022-04-08 04:02:09,717 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-08 04:02:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:11,155 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 04:02:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 04:02:11,155 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-08 04:02:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:11,156 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-08 04:02:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-08 04:02:11,157 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-08 04:02:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-04-08 04:02:11,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 38 transitions. [2022-04-08 04:02:11,206 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-08 04:02:11,207 INFO L225 Difference]: With dead ends: 38 [2022-04-08 04:02:11,207 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 04:02:11,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-08 04:02:11,207 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:11,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 04:02:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 04:02:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 04:02:11,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:11,246 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-08 04:02:11,246 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-08 04:02:11,246 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-08 04:02:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:11,246 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 04:02:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 04:02:11,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:11,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:11,247 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-08 04:02:11,247 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-08 04:02:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:11,247 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 04:02:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 04:02:11,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:11,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:11,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:11,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:11,248 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-08 04:02:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-08 04:02:11,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-08 04:02:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:11,249 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-08 04:02:11,249 INFO L479 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-08 04:02:11,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-08 04:02:11,325 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-08 04:02:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-08 04:02:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 04:02:11,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:11,325 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:11,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 04:02:11,526 WARN L460 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-08 04:02:11,526 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 35 times [2022-04-08 04:02:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93234962] [2022-04-08 04:02:11,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1225880703, now seen corresponding path program 36 times [2022-04-08 04:02:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533771421] [2022-04-08 04:02:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:11,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:11,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578875538] [2022-04-08 04:02:11,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:02:11,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:11,583 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:02:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 04:02:11,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 04:02:11,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:11,663 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-08 04:02:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:11,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:12,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#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_96~0 := 0; {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#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; {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-08 04:02:12,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6051#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:12,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {6051#(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; {6055#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:02:12,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {6055#(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; {6059#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:02:12,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {6059#(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; {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:02:12,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {6063#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 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; {6067#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:02:12,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(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; {6071#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 04:02:12,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {6071#(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; {6075#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:12,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#(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; {6079#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:02:12,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {6079#(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; {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:12,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {6083#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ 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; {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 04:02:12,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {6087#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6091#(and (= (+ main_~main__sum~0 (- 44)) main_~main__i~0) (= (+ (- 45) main_~main__sum~0) 10))} is VALID [2022-04-08 04:02:12,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#(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; {6095#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 42)) (= (+ (- 2) main_~main__i~0) 10))} is VALID [2022-04-08 04:02:12,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(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; {6099#(and (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 39)) (= (+ (- 3) main_~main__i~0) 10))} is VALID [2022-04-08 04:02:12,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {6099#(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; {6103#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:02:12,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {6103#(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; {6107#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-08 04:02:12,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {6107#(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; {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-08 04:02:12,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {6111#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) main_~main__sum~0 (* (- 2) main_~main__i~0))))} is VALID [2022-04-08 04:02:12,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#(and (= (+ (- 88) main_~main__sum~0 (* (- 2) main_~main__i~0)) 14) (= (+ (- 2) main_~main__i~0) (+ (- 87) 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; {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:02:12,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {6119#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 85)) 14) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 84)) (+ (- 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; {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:02:12,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {6123#(and (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 81)) 14) (= (+ main_~main__sum~0 (- 80) (* (- 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; {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 5) main_~main__i~0))))} is VALID [2022-04-08 04:02:12,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {6127#(and (= (+ main_~main__sum~0 (- 76) (* (- 5) main_~main__i~0)) 14) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 75) (* (- 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; {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} is VALID [2022-04-08 04:02:12,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {6131#(and (= (+ (* (- 6) main_~main__i~0) (- 69) main_~main__sum~0) (+ (- 6) main_~main__i~0)) (= 14 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 70))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 04:02:12,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {6135#(and (= 14 (+ (- 63) main_~main__sum~0 (* (- 7) main_~main__i~0))) (= (+ main_~main__sum~0 (- 62) (* (- 7) main_~main__i~0)) (+ (- 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; {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* main_~main__i~0 (- 8)))))} is VALID [2022-04-08 04:02:12,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {6139#(and (= (+ main_~main__sum~0 (* main_~main__i~0 (- 8)) (- 54)) (+ main_~main__i~0 (- 8))) (= 14 (+ (- 55) main_~main__sum~0 (* 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; {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ main_~main__sum~0 1)))} is VALID [2022-04-08 04:02:12,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {6143#(and (<= main_~main__sum~0 (+ main_~main__n~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9)))) (= (mod (+ main_~main__sum~0 3) 9) 0) (= (+ (* (- 1) (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) main_~main__sum~0 (- 8)) (+ (* 9 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (* main_~main__sum~0 (- 8)) (- 54))) (<= (+ main_~main__i~0 (div (+ (- 69) (* main_~main__sum~0 (- 8))) (- 9))) (+ 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; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:12,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-08 04:02:12,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-08 04:02:12,744 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-08 04:02:12,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:18,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {6026#false} assume !false; {6026#false} is VALID [2022-04-08 04:02:18,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6026#false} is VALID [2022-04-08 04:02:18,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {6160#(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; {6147#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:18,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6160#(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-08 04:02:18,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {6025#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6164#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:18,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {6025#true} assume !!(1 <= ~main__n~0); {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {6025#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; {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {6025#true} call #t~ret5 := main(); {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6025#true} {6025#true} #58#return; {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {6025#true} assume true; {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {6025#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_96~0 := 0; {6025#true} is VALID [2022-04-08 04:02:18,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {6025#true} call ULTIMATE.init(); {6025#true} is VALID [2022-04-08 04:02:18,987 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-08 04:02:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533771421] [2022-04-08 04:02:18,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578875538] [2022-04-08 04:02:18,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578875538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:18,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:18,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 5] total 29 [2022-04-08 04:02:18,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93234962] [2022-04-08 04:02:18,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93234962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:18,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:18,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 04:02:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067222040] [2022-04-08 04:02:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:18,989 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-08 04:02:18,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:18,989 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-08 04:02:19,032 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-08 04:02:19,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 04:02:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 04:02:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2022-04-08 04:02:19,033 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-08 04:02:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:20,885 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 04:02:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 04:02:20,886 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-08 04:02:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:20,886 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-08 04:02:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-08 04:02:20,887 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-08 04:02:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-04-08 04:02:20,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 39 transitions. [2022-04-08 04:02:20,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:20,951 INFO L225 Difference]: With dead ends: 39 [2022-04-08 04:02:20,951 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 04:02:20,952 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:02:20,952 INFO L913 BasicCegarLoop]: 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-08 04:02:20,952 INFO L914 BasicCegarLoop]: 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-08 04:02:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 04:02:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 04:02:20,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:20,987 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-08 04:02:20,987 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-08 04:02:20,988 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-08 04:02:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:20,988 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 04:02:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 04:02:20,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:20,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:20,989 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-08 04:02:20,989 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-08 04:02:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:20,990 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-08 04:02:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 04:02:20,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:20,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:20,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:20,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:20,990 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-08 04:02:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-08 04:02:20,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-08 04:02:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:20,991 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-08 04:02:20,991 INFO L479 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-08 04:02:20,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-08 04:02:21,063 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-08 04:02:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-08 04:02:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 04:02:21,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:21,063 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:21,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 04:02:21,264 WARN L460 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-08 04:02:21,264 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 37 times [2022-04-08 04:02:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280940481] [2022-04-08 04:02:21,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash 652341418, now seen corresponding path program 38 times [2022-04-08 04:02:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647353280] [2022-04-08 04:02:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:21,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:21,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164486710] [2022-04-08 04:02:21,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:02:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:21,282 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:02:21,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 04:02:21,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:02:21,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:21,347 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-08 04:02:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:21,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-08 04:02:21,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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_96~0 := 0; {6481#true} is VALID [2022-04-08 04:02:21,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-08 04:02:21,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-08 04:02:21,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-08 04:02:21,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#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; {6481#true} is VALID [2022-04-08 04:02:21,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-08 04:02:21,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6507#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:21,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {6507#(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; {6511#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:02:21,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {6511#(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; {6515#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:02:21,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {6515#(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; {6519#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:02:21,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {6519#(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; {6523#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:02:21,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#(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; {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 3 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:02:21,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {6527#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) 3) (= 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; {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 3 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:02:21,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#(and (= 3 (+ main_~main__sum~0 (* (- 4) main_~main__i~0) 10)) (= 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; {6535#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:02:21,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {6535#(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; {6539#(and (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:02:21,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {6539#(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; {6543#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 04:02:21,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {6543#(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; {6547#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:02:21,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#(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; {6551#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 04:02:21,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {6551#(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; {6555#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:02:21,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {6555#(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; {6559#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:02:21,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {6559#(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; {6563#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:02:21,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {6563#(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; {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} is VALID [2022-04-08 04:02:21,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {6567#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6571#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:02:21,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {6571#(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; {6575#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:02:21,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {6575#(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; {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} is VALID [2022-04-08 04:02:21,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {6579#(and (= 16 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 114)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6583#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:02:21,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {6583#(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; {6587#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-08 04:02:21,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {6587#(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; {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 04:02:21,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {6591#(and (= (+ 188 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-08 04:02:21,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {6595#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 04:02:21,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {6599#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 42)) 210) (= (+ (- 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; {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 24 main_~main__n~0))} is VALID [2022-04-08 04:02:21,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {6603#(and (<= main_~main__i~0 25) (= (+ main_~main__sum~0 (- 90)) 210) (<= 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; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:21,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-08 04:02:21,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-08 04:02:21,991 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-08 04:02:21,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:27,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-08 04:02:27,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6482#false} is VALID [2022-04-08 04:02:27,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {6620#(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; {6607#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:27,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6620#(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-08 04:02:27,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6624#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:27,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {6481#true} assume !!(1 <= ~main__n~0); {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {6481#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; {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {6481#true} call #t~ret5 := main(); {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6481#true} {6481#true} #58#return; {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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_96~0 := 0; {6481#true} is VALID [2022-04-08 04:02:27,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-08 04:02:27,870 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-08 04:02:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647353280] [2022-04-08 04:02:27,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164486710] [2022-04-08 04:02:27,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164486710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:27,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:27,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 30 [2022-04-08 04:02:27,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280940481] [2022-04-08 04:02:27,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280940481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:27,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:27,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 04:02:27,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412694793] [2022-04-08 04:02:27,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:27,872 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-08 04:02:27,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:27,872 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-08 04:02:27,917 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-08 04:02:27,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 04:02:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 04:02:27,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2022-04-08 04:02:27,918 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-08 04:02:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:29,821 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 04:02:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 04:02:29,821 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-08 04:02:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:29,821 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-08 04:02:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-08 04:02:29,822 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-08 04:02:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-04-08 04:02:29,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 40 transitions. [2022-04-08 04:02:29,871 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-08 04:02:29,872 INFO L225 Difference]: With dead ends: 40 [2022-04-08 04:02:29,872 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 04:02:29,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-08 04:02:29,872 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:29,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 218 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 04:02:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 04:02:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 04:02:29,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:29,908 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-08 04:02:29,908 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-08 04:02:29,908 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-08 04:02:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:29,909 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 04:02:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 04:02:29,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:29,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:29,909 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-08 04:02:29,909 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-08 04:02:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:29,910 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-08 04:02:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 04:02:29,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:29,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:29,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:29,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:29,910 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-08 04:02:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-08 04:02:29,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-08 04:02:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:29,911 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-08 04:02:29,911 INFO L479 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-08 04:02:29,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-08 04:02:29,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-08 04:02:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 04:02:29,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:29,999 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:30,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 04:02:30,199 WARN L460 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-08 04:02:30,199 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:30,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 39 times [2022-04-08 04:02:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:30,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230545115] [2022-04-08 04:02:30,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1252314975, now seen corresponding path program 40 times [2022-04-08 04:02:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:30,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803723820] [2022-04-08 04:02:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:30,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:30,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935211370] [2022-04-08 04:02:30,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:02:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:30,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:30,239 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:02:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 04:02:30,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:02:30,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:30,313 WARN L261 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-08 04:02:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:30,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:31,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#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_96~0 := 0; {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#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; {6950#true} is VALID [2022-04-08 04:02:31,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-08 04:02:31,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {6976#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:31,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {6976#(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; {6980#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:02:31,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {6980#(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; {6984#(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-08 04:02:31,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {6984#(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; {6988#(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-08 04:02:31,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {6988#(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; {6992#(and (= 2 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 5))))} is VALID [2022-04-08 04:02:31,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {6992#(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; {6996#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 04:02:31,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {6996#(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; {7000#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 04:02:31,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {7000#(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; {7004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:02:31,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {7004#(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; {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:31,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {7008#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ 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; {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 04:02:31,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {7012#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:02:31,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {7016#(and (= (+ main_~main__sum~0 (- 27)) 28) (= 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; {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) main_~main__sum~0) 28))} is VALID [2022-04-08 04:02:31,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {7020#(and (= 12 main_~main__i~0) (= (+ (- 38) 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; {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 1) main_~main__i~0)) 28))} is VALID [2022-04-08 04:02:31,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {7024#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ main_~main__sum~0 (- 37) (* (- 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; {7028#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:02:31,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {7028#(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; {7032#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:02:31,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {7032#(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; {7036#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-08 04:02:31,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {7036#(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; {7040#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:02:31,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {7040#(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; {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-08 04:02:31,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {7044#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7048#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 04:02:31,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#(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; {7052#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:02:31,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {7052#(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; {7056#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 04:02:31,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {7056#(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; {7060#(and (= 22 main_~main__i~0) (= 190 (+ main_~main__sum~0 (- 41))))} is VALID [2022-04-08 04:02:31,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {7060#(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; {7064#(and (= 23 main_~main__i~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-08 04:02:31,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {7064#(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; {7068#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24))} is VALID [2022-04-08 04:02:31,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {7068#(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; {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-08 04:02:31,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {7072#(and (= (+ (- 1) main_~main__i~0) 24) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 main_~main__n~0))} is VALID [2022-04-08 04:02:31,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {7076#(and (= 190 (+ main_~main__sum~0 (- 135))) (<= main_~main__i~0 26) (<= 25 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; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:31,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-08 04:02:31,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-08 04:02:31,088 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-08 04:02:31,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:37,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {6951#false} assume !false; {6951#false} is VALID [2022-04-08 04:02:37,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {6951#false} is VALID [2022-04-08 04:02:37,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {7093#(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; {7080#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:37,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7093#(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-08 04:02:37,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {6950#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7097#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:37,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {6950#true} assume !!(1 <= ~main__n~0); {6950#true} is VALID [2022-04-08 04:02:37,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {6950#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; {6950#true} is VALID [2022-04-08 04:02:37,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {6950#true} call #t~ret5 := main(); {6950#true} is VALID [2022-04-08 04:02:37,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6950#true} {6950#true} #58#return; {6950#true} is VALID [2022-04-08 04:02:37,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {6950#true} assume true; {6950#true} is VALID [2022-04-08 04:02:37,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {6950#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_96~0 := 0; {6950#true} is VALID [2022-04-08 04:02:37,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {6950#true} call ULTIMATE.init(); {6950#true} is VALID [2022-04-08 04:02:37,636 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-08 04:02:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803723820] [2022-04-08 04:02:37,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935211370] [2022-04-08 04:02:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935211370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:37,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:37,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5] total 31 [2022-04-08 04:02:37,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230545115] [2022-04-08 04:02:37,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230545115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:37,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:37,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 04:02:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075753239] [2022-04-08 04:02:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:37,637 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-08 04:02:37,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:37,638 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-08 04:02:37,688 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-08 04:02:37,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 04:02:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 04:02:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2022-04-08 04:02:37,689 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-08 04:02:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:40,275 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 04:02:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 04:02:40,275 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-08 04:02:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:40,276 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-08 04:02:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-08 04:02:40,276 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-08 04:02:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-04-08 04:02:40,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 41 transitions. [2022-04-08 04:02:40,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:40,350 INFO L225 Difference]: With dead ends: 41 [2022-04-08 04:02:40,350 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 04:02:40,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-04-08 04:02:40,351 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:40,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 04:02:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 04:02:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 04:02:40,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:40,392 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-08 04:02:40,392 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-08 04:02:40,392 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-08 04:02:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:40,393 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 04:02:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 04:02:40,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:40,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:40,394 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-08 04:02:40,394 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-08 04:02:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:40,394 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 04:02:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 04:02:40,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:40,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:40,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:40,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:40,395 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-08 04:02:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-08 04:02:40,396 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-08 04:02:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:40,396 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-08 04:02:40,396 INFO L479 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-08 04:02:40,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-08 04:02:40,480 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-08 04:02:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-08 04:02:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 04:02:40,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:40,481 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:40,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 04:02:40,681 WARN L460 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-08 04:02:40,681 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 41 times [2022-04-08 04:02:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486741174] [2022-04-08 04:02:40,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -167121014, now seen corresponding path program 42 times [2022-04-08 04:02:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364014448] [2022-04-08 04:02:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:40,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515830143] [2022-04-08 04:02:40,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:02:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:40,754 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-08 04:02:40,804 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-08 04:02:40,871 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 04:02:40,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:40,873 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 112 conjunts are in the unsatisfiable core [2022-04-08 04:02:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:40,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:41,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#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_96~0 := 0; {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#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; {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-08 04:02:41,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7458#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:41,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {7458#(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; {7462#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:02:41,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {7462#(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; {7466#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:02:41,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {7466#(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; {7470#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:02:41,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {7470#(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; {7474#(and (= 3 (+ (- 2) main_~main__i~0)) (= 3 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:02:41,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {7474#(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; {7478#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 04:02:41,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {7478#(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; {7482#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:41,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(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; {7486#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 04:02:41,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {7486#(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; {7490#(and (= (+ (- 1) main_~main__i~0) 8) (= main_~main__sum~0 (+ main_~main__i~0 27)))} is VALID [2022-04-08 04:02:41,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {7490#(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; {7494#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:02:41,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {7494#(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; {7498#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:02:41,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(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; {7502#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 04:02:41,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {7502#(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; {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:02:41,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {7506#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) 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; {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:02:41,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 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; {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:02:41,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {7514#(and (= (+ (- 1) main_~main__i~0) 14) (= 45 (+ (- 45) 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; {7518#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:02:41,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {7518#(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; {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:02:41,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {7522#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {7526#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:02:41,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {7526#(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; {7530#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 04:02:41,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {7530#(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; {7534#(and (= (+ (- 1) main_~main__i~0) 19) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 17))))} is VALID [2022-04-08 04:02:41,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {7534#(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; {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~0)) 153))} is VALID [2022-04-08 04:02:41,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {7538#(and (= 19 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (- 15) (* (- 2) main_~main__i~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; {7542#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-08 04:02:41,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {7542#(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; {7546#(and (= main_~main__sum~0 (+ main_~main__i~0 230)) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 04:02:41,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(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; {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 04:02:41,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {7550#(and (= (+ main_~main__sum~0 (- 23)) 253) (= 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; {7554#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-08 04:02:41,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {7554#(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; {7558#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-08 04:02:41,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(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; {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 26 main_~main__n~0))} is VALID [2022-04-08 04:02:41,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {7562#(and (<= main_~main__i~0 27) (= main_~main__sum~0 351) (<= 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; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:41,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-08 04:02:41,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-08 04:02:41,621 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-08 04:02:41,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:02:48,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {7433#false} assume !false; {7433#false} is VALID [2022-04-08 04:02:48,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7433#false} is VALID [2022-04-08 04:02:48,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {7579#(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; {7566#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:48,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7579#(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-08 04:02:48,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:48,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7583#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:02:49,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {7432#true} assume !!(1 <= ~main__n~0); {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {7432#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; {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret5 := main(); {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #58#return; {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {7432#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_96~0 := 0; {7432#true} is VALID [2022-04-08 04:02:49,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7432#true} is VALID [2022-04-08 04:02:49,130 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-08 04:02:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:02:49,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364014448] [2022-04-08 04:02:49,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:02:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515830143] [2022-04-08 04:02:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515830143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:02:49,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:02:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 32 [2022-04-08 04:02:49,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:02:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486741174] [2022-04-08 04:02:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486741174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:02:49,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:02:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 04:02:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730794342] [2022-04-08 04:02:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:02:49,131 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-08 04:02:49,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:02:49,132 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-08 04:02:49,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:49,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 04:02:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 04:02:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2022-04-08 04:02:49,182 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-08 04:02:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:51,952 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 04:02:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 04:02:51,952 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-08 04:02:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:02:51,953 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-08 04:02:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-08 04:02:51,954 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-08 04:02:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-04-08 04:02:51,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 42 transitions. [2022-04-08 04:02:52,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:52,017 INFO L225 Difference]: With dead ends: 42 [2022-04-08 04:02:52,017 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 04:02:52,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 04:02:52,018 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:52,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 04:02:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 04:02:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 04:02:52,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:52,061 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-08 04:02:52,061 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-08 04:02:52,061 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-08 04:02:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:52,062 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 04:02:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 04:02:52,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:52,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:52,062 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-08 04:02:52,062 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-08 04:02:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:52,063 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-08 04:02:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 04:02:52,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:52,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:52,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:52,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:52,063 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-08 04:02:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-08 04:02:52,064 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-08 04:02:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:52,064 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-08 04:02:52,064 INFO L479 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-08 04:02:52,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-08 04:02:52,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-08 04:02:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 04:02:52,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:02:52,144 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:02:52,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 04:02:52,344 WARN L460 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-08 04:02:52,345 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:02:52,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:02:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 43 times [2022-04-08 04:02:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:02:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218475186] [2022-04-08 04:02:52,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:02:52,346 INFO L85 PathProgramCache]: Analyzing trace with hash -885846591, now seen corresponding path program 44 times [2022-04-08 04:02:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:02:52,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708472289] [2022-04-08 04:02:52,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:02:52,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:02:52,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:02:52,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847462229] [2022-04-08 04:02:52,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:02:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:02:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:02:52,363 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-08 04:02:52,363 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-08 04:02:52,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:02:52,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:02:52,416 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-08 04:02:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:02:52,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:02:53,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-08 04:02:53,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#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_96~0 := 0; {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#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; {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-08 04:02:53,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {7953#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:02:53,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {7953#(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; {7957#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:02:53,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {7957#(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; {7961#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:02:53,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {7961#(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; {7965#(and (= (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:02:53,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(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; {7969#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:02:53,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {7969#(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; {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:02:53,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {7973#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) 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; {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:02:53,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {7977#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) 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; {7981#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:02:53,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {7981#(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; {7985#(and (= (+ (- 1) main_~main__i~0) 8) (= 28 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:53,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {7985#(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; {7989#(and (= (+ (- 2) main_~main__i~0) 8) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 25)))} is VALID [2022-04-08 04:02:53,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {7989#(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; {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:02:53,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {7993#(and (= 8 (+ (- 3) main_~main__i~0)) (= (+ 23 (* 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; {7997#(and (= 66 main_~main__sum~0) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:02:53,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {7997#(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; {8001#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:02:53,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {8001#(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; {8005#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:02:53,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {8005#(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; {8009#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:02:53,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {8009#(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; {8013#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:02:53,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {8013#(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; {8017#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-08 04:02:53,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {8017#(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; {8021#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 04:02:53,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {8021#(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; {8025#(and (= 19 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 04:02:53,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {8025#(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; {8029#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 04:02:53,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {8029#(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; {8033#(and (= (+ (- 1) main_~main__i~0) 20) (= main_~main__sum~0 (+ 189 main_~main__i~0)))} is VALID [2022-04-08 04:02:53,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {8033#(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; {8037#(and (= 22 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 210))} is VALID [2022-04-08 04:02:53,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {8037#(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; {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 04:02:53,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {8041#(and (= (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0)) 210) (= (+ (- 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; {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= main_~main__i~0 24))} is VALID [2022-04-08 04:02:53,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {8045#(and (= (+ main_~main__sum~0 (- 66)) 210) (= 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; {8049#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 04:02:53,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {8049#(and (= (+ main_~main__sum~0 (- 276)) 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; {8053#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 04:02:53,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {8053#(and (= 26 main_~main__i~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; {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 04:02:53,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {8057#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 04:02:53,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {8061#(and (<= main_~main__i~0 28) (<= 27 main_~main__n~0) (= main_~main__sum~0 378))} 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; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:02:53,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-08 04:02:53,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-08 04:02:53,159 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-08 04:02:53,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:03:01,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {7928#false} assume !false; {7928#false} is VALID [2022-04-08 04:03:01,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {7928#false} is VALID [2022-04-08 04:03:01,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {8078#(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; {8065#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:01,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8078#(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-08 04:03:01,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {7927#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8082#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:01,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {7927#true} assume !!(1 <= ~main__n~0); {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {7927#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; {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {7927#true} call #t~ret5 := main(); {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7927#true} {7927#true} #58#return; {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {7927#true} assume true; {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {7927#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_96~0 := 0; {7927#true} is VALID [2022-04-08 04:03:01,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {7927#true} call ULTIMATE.init(); {7927#true} is VALID [2022-04-08 04:03:01,576 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-08 04:03:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:03:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708472289] [2022-04-08 04:03:01,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:03:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847462229] [2022-04-08 04:03:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847462229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:03:01,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:03:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 5] total 33 [2022-04-08 04:03:01,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:03:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218475186] [2022-04-08 04:03:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218475186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:03:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:03:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 04:03:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412724901] [2022-04-08 04:03:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:03:01,577 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-08 04:03:01,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:03:01,578 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-08 04:03:01,628 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-08 04:03:01,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 04:03:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 04:03:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 04:03:01,629 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-08 04:03:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:04,468 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 04:03:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 04:03:04,468 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-08 04:03:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:03:04,468 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-08 04:03:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-08 04:03:04,470 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-08 04:03:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-04-08 04:03:04,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 43 transitions. [2022-04-08 04:03:04,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:04,529 INFO L225 Difference]: With dead ends: 43 [2022-04-08 04:03:04,529 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 04:03:04,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 04:03:04,530 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:03:04,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 04:03:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 04:03:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 04:03:04,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:03:04,572 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-08 04:03:04,572 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-08 04:03:04,572 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-08 04:03:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:04,572 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 04:03:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 04:03:04,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:04,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:04,573 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-08 04:03:04,573 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-08 04:03:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:04,573 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-08 04:03:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 04:03:04,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:04,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:04,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:03:04,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:03:04,573 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-08 04:03:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-08 04:03:04,574 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-08 04:03:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:03:04,574 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-08 04:03:04,574 INFO L479 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-08 04:03:04,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-08 04:03:04,768 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-08 04:03:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-08 04:03:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 04:03:04,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:03:04,769 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:03:04,791 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-08 04:03:04,969 WARN L460 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-08 04:03:04,969 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:03:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:03:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 45 times [2022-04-08 04:03:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:04,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802671352] [2022-04-08 04:03:04,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:03:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1691502998, now seen corresponding path program 46 times [2022-04-08 04:03:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:03:04,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362716800] [2022-04-08 04:03:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:03:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:03:04,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:03:04,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391247407] [2022-04-08 04:03:04,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:03:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:03:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:03:04,998 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-08 04:03:04,999 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-08 04:03:05,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:03:05,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:03:05,063 WARN L261 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-08 04:03:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:03:05,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:03:05,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#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_96~0 := 0; {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#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; {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-08 04:03:05,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8461#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:03:05,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {8461#(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; {8465#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:03:05,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {8465#(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; {8469#(and (= (+ main_~main__sum~0 (- 3)) 0) (= 3 main_~main__i~0))} is VALID [2022-04-08 04:03:05,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {8469#(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; {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 2 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:03:05,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {8473#(and (= (+ (- 1) main_~main__i~0) 3) (= (+ 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; {8477#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:03:05,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {8477#(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; {8481#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 04:03:05,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {8481#(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; {8485#(and (= 7 main_~main__i~0) (= 10 (+ (- 11) main_~main__sum~0)))} is VALID [2022-04-08 04:03:05,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {8485#(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; {8489#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:03:05,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#(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; {8493#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-08 04:03:05,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {8493#(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; {8497#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 04:03:05,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {8497#(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; {8501#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:03:05,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {8501#(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; {8505#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 04:03:05,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {8505#(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; {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:03:05,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {8509#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) 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; {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 18))))} is VALID [2022-04-08 04:03:05,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {8513#(and (= (+ (- 2) main_~main__i~0) 12) (= 45 (+ main_~main__sum~0 (* (- 2) 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; {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 15))))} is VALID [2022-04-08 04:03:05,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#(and (= 12 (+ (- 3) main_~main__i~0)) (= 45 (+ main_~main__sum~0 (* (- 3) 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; {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 4 main_~main__i~0))))} is VALID [2022-04-08 04:03:05,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {8521#(and (= 12 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ 56 (* 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; {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) main_~main__i~0) 12))} is VALID [2022-04-08 04:03:05,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(and (= main_~main__sum~0 (+ 51 (* 5 main_~main__i~0))) (= (+ (- 5) 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; {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} is VALID [2022-04-08 04:03:05,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {8529#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8533#(and (= 19 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 136))} is VALID [2022-04-08 04:03:05,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {8533#(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; {8537#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:03:05,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {8537#(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; {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:03:05,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {8541#(and (= (+ (- 1) main_~main__i~0) 20) (= 190 (+ 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; {8545#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 04:03:05,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {8545#(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; {8549#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-08 04:03:05,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(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; {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 04:03:05,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {8553#(and (= (+ main_~main__sum~0 (- 23)) 253) (= 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; {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} is VALID [2022-04-08 04:03:05,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {8557#(and (= (+ (- 1) main_~main__i~0) 24) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 22)) 253))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8561#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 04:03:05,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {8561#(and (= 26 main_~main__i~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; {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 04:03:05,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {8565#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 04:03:05,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {8569#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 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; {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= main_~main__i~0 29))} is VALID [2022-04-08 04:03:05,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {8573#(and (<= 28 main_~main__n~0) (= (+ main_~main__sum~0 (- 81)) 325) (<= 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; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:05,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-08 04:03:05,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-08 04:03:05,949 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-08 04:03:05,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:03:15,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {8436#false} assume !false; {8436#false} is VALID [2022-04-08 04:03:15,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8436#false} is VALID [2022-04-08 04:03:15,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {8590#(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; {8577#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:15,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8590#(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-08 04:03:15,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {8435#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8594#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:15,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {8435#true} assume !!(1 <= ~main__n~0); {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {8435#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; {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {8435#true} call #t~ret5 := main(); {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8435#true} {8435#true} #58#return; {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {8435#true} assume true; {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {8435#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_96~0 := 0; {8435#true} is VALID [2022-04-08 04:03:15,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {8435#true} call ULTIMATE.init(); {8435#true} is VALID [2022-04-08 04:03:15,806 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-08 04:03:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:03:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362716800] [2022-04-08 04:03:15,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:03:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391247407] [2022-04-08 04:03:15,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391247407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:03:15,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:03:15,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 5] total 34 [2022-04-08 04:03:15,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:03:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802671352] [2022-04-08 04:03:15,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802671352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:03:15,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:03:15,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 04:03:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281358104] [2022-04-08 04:03:15,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:03:15,808 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-08 04:03:15,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:03:15,808 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-08 04:03:15,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:15,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 04:03:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:15,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 04:03:15,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 04:03:15,860 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-08 04:03:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:19,745 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 04:03:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 04:03:19,745 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-08 04:03:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:03:19,746 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-08 04:03:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-08 04:03:19,746 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-08 04:03:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-08 04:03:19,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-08 04:03:19,820 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-08 04:03:19,821 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:03:19,821 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 04:03:19,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 04:03:19,822 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:03:19,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 04:03:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 04:03:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 04:03:19,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:03:19,861 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-08 04:03:19,861 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-08 04:03:19,861 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-08 04:03:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:19,862 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 04:03:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 04:03:19,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:19,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:19,862 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-08 04:03:19,862 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-08 04:03:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:19,863 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-08 04:03:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 04:03:19,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:19,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:19,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:03:19,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:03:19,863 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-08 04:03:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-08 04:03:19,864 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-08 04:03:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:03:19,864 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-08 04:03:19,864 INFO L479 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-08 04:03:19,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-08 04:03:19,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-08 04:03:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 04:03:19,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:03:19,950 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:03:19,967 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-08 04:03:20,150 WARN L460 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-08 04:03:20,151 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:03:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:03:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 47 times [2022-04-08 04:03:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758781013] [2022-04-08 04:03:20,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:03:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -897047839, now seen corresponding path program 48 times [2022-04-08 04:03:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:03:20,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546597649] [2022-04-08 04:03:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:03:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:03:20,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:03:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337178736] [2022-04-08 04:03:20,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:03:20,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:03:20,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:03:20,169 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-08 04:03:20,169 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-08 04:03:20,227 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 04:03:20,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:03:20,229 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-08 04:03:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:03:20,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:03:21,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#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_96~0 := 0; {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#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; {8956#true} is VALID [2022-04-08 04:03:21,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8979#(<= 1 main_~main__n~0)} is VALID [2022-04-08 04:03:21,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {8979#(<= 1 main_~main__n~0)} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {8983#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:03:21,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {8983#(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; {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:03:21,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {8987#(and (= 2 main_~main__i~0) (<= 1 main_~main__n~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; {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {8991#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 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; {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {8995#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 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; {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {8999#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 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; {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 15)) 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; {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {9007#(and (= 0 (+ (- 14) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 6) (<= 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; {9011#(and (<= 1 main_~main__n~0) (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:03:21,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {9011#(and (<= 1 main_~main__n~0) (= 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; {9015#(and (<= 1 main_~main__n~0) (= (+ main_~main__sum~0 (- 8)) 28) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:03:21,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {9015#(and (<= 1 main_~main__n~0) (= (+ 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; {9019#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 04:03:21,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {9019#(and (<= 1 main_~main__n~0) (= (+ (- 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; {9023#(and (<= 1 main_~main__n~0) (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:03:21,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#(and (<= 1 main_~main__n~0) (= 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; {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:03:21,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {9027#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~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; {9031#(and (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-08 04:03:21,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 1 main_~main__n~0) (= (+ (- 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; {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {9035#(and (= main_~main__sum~0 (+ 49 (* 3 main_~main__i~0))) (= (+ (- 3) main_~main__i~0) 11) (<= 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; {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~0) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:03:21,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {9039#(and (= 91 (+ (- 14) main_~main__sum~0)) (<= 1 main_~main__n~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; {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:03:21,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {9043#(and (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 15) (= 91 (+ (- 13) 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; {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:03:21,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {9047#(and (= 17 main_~main__i~0) (<= 1 main_~main__n~0) (= main_~main__sum~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; {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {9051#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 136) (<= 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; {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~0) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 04:03:21,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {9055#(and (= (+ 152 main_~main__i~0) main_~main__sum~0) (<= 1 main_~main__n~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; {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-08 04:03:21,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {9059#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 150)) (<= 1 main_~main__n~0) (= (+ (- 2) 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; {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 04:03:21,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {9063#(and (= 21 main_~main__i~0) (<= 1 main_~main__n~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; {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 19))))} is VALID [2022-04-08 04:03:21,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {9067#(and (= (+ (- 1) main_~main__i~0) 21) (<= 1 main_~main__n~0) (= 190 (+ 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; {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~0) (= 190 (+ (- 63) main_~main__sum~0)))} is VALID [2022-04-08 04:03:21,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {9071#(and (= 23 main_~main__i~0) (<= 1 main_~main__n~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; {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {9075#(and (= 190 (+ (- 86) main_~main__sum~0)) (= main_~main__i~0 24) (<= 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; {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} is VALID [2022-04-08 04:03:21,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {9079#(and (= (+ (- 1) main_~main__i~0) 24) (<= 1 main_~main__n~0) (= 190 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 85))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 main_~main__i~0) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {9083#(and (= 190 (+ main_~main__sum~0 (- 135))) (= 26 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; {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~0) (= main_~main__i~0 27))} is VALID [2022-04-08 04:03:21,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {9087#(and (= main_~main__sum~0 351) (<= 1 main_~main__n~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; {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (<= 1 main_~main__n~0))} is VALID [2022-04-08 04:03:21,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(and (= (+ (- 1) main_~main__i~0) 27) (= 351 (+ 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; {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~0) (= 29 main_~main__i~0))} is VALID [2022-04-08 04:03:21,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(and (= main_~main__sum~0 406) (<= 1 main_~main__n~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; {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 29 main_~main__n~0))} is VALID [2022-04-08 04:03:21,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {9099#(and (<= main_~main__i~0 30) (= main_~main__sum~0 435) (<= 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; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:21,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-08 04:03:21,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-08 04:03:21,244 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-08 04:03:21,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:03:23,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {8957#false} assume !false; {8957#false} is VALID [2022-04-08 04:03:23,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {8957#false} is VALID [2022-04-08 04:03:23,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(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; {9103#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:23,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9116#(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-08 04:03:23,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {9124#(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; {9120#(or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))} is VALID [2022-04-08 04:03:23,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {9128#(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; {9124#(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-08 04:03:23,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {9132#(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; {9128#(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-08 04:03:23,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {9136#(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; {9132#(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-08 04:03:23,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {9140#(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; {9136#(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-08 04:03:23,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {9144#(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; {9140#(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-08 04:03:23,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {9148#(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; {9144#(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-08 04:03:23,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {9152#(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; {9148#(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-08 04:03:23,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {9156#(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; {9152#(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-08 04:03:23,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {9160#(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; {9156#(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-08 04:03:23,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {9164#(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; {9160#(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-08 04:03:23,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {9168#(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; {9164#(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-08 04:03:23,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {9172#(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; {9168#(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-08 04:03:23,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {9176#(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; {9172#(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-08 04:03:23,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {9180#(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; {9176#(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-08 04:03:23,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {9184#(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; {9180#(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-08 04:03:23,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {9188#(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; {9184#(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-08 04:03:23,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {9192#(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; {9188#(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-08 04:03:23,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {9196#(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; {9192#(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-08 04:03:23,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {9200#(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; {9196#(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-08 04:03:23,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {9204#(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; {9200#(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-08 04:03:23,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {9208#(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; {9204#(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-08 04:03:23,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {9212#(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; {9208#(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-08 04:03:23,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {9216#(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; {9212#(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-08 04:03:23,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {9220#(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; {9216#(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-08 04:03:23,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {9224#(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; {9220#(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-08 04:03:23,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {9228#(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; {9224#(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-08 04:03:23,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {9232#(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; {9228#(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-08 04:03:23,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {8956#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9232#(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-08 04:03:23,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {8956#true} assume !!(1 <= ~main__n~0); {8956#true} is VALID [2022-04-08 04:03:23,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {8956#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; {8956#true} is VALID [2022-04-08 04:03:23,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {8956#true} call #t~ret5 := main(); {8956#true} is VALID [2022-04-08 04:03:23,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8956#true} {8956#true} #58#return; {8956#true} is VALID [2022-04-08 04:03:23,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {8956#true} assume true; {8956#true} is VALID [2022-04-08 04:03:23,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {8956#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_96~0 := 0; {8956#true} is VALID [2022-04-08 04:03:23,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {8956#true} call ULTIMATE.init(); {8956#true} is VALID [2022-04-08 04:03:23,784 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-08 04:03:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:03:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546597649] [2022-04-08 04:03:23,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:03:23,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337178736] [2022-04-08 04:03:23,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337178736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:03:23,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:03:23,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2022-04-08 04:03:23,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:03:23,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758781013] [2022-04-08 04:03:23,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758781013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:03:23,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:03:23,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 04:03:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333629047] [2022-04-08 04:03:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:03:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:23,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:03:23,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:23,917 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-08 04:03:23,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 04:03:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 04:03:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=3033, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 04:03:23,919 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:28,482 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 04:03:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 04:03:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:03:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 04:03:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 04:03:28,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 04:03:28,562 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-08 04:03:28,562 INFO L225 Difference]: With dead ends: 45 [2022-04-08 04:03:28,562 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 04:03:28,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1005, Invalid=3155, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 04:03:28,564 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:03:28,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 217 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 04:03:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 04:03:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 04:03:28,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:03:28,606 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-08 04:03:28,606 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-08 04:03:28,606 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-08 04:03:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:28,606 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 04:03:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 04:03:28,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:28,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:28,607 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-08 04:03:28,607 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-08 04:03:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:28,607 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-08 04:03:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 04:03:28,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:28,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:28,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:03:28,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:03:28,608 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-08 04:03:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-08 04:03:28,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-08 04:03:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:03:28,608 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-08 04:03:28,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 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-08 04:03:28,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-08 04:03:28,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-08 04:03:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 04:03:28,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:03:28,700 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:03:28,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-08 04:03:28,900 WARN L460 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-08 04:03:28,901 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:03:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:03:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 49 times [2022-04-08 04:03:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:28,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142472722] [2022-04-08 04:03:28,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:03:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2038741686, now seen corresponding path program 50 times [2022-04-08 04:03:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:03:28,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116835761] [2022-04-08 04:03:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:03:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:03:28,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:03:28,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457297661] [2022-04-08 04:03:28,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:03:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:03:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:03:28,940 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-08 04:03:28,942 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-08 04:03:29,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:03:29,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:03:29,008 WARN L261 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 128 conjunts are in the unsatisfiable core [2022-04-08 04:03:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:03:29,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:03:29,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-08 04:03:29,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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_96~0 := 0; {9519#true} is VALID [2022-04-08 04:03:29,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-08 04:03:29,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-08 04:03:29,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-08 04:03:29,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#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; {9519#true} is VALID [2022-04-08 04:03:29,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-08 04:03:29,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9545#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:03:29,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {9545#(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; {9549#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:03:29,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {9549#(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; {9553#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:03:29,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {9553#(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; {9557#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:03:29,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {9557#(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; {9561#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 04:03:29,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {9561#(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; {9565#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 04:03:29,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {9565#(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; {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:03:29,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {9569#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) 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; {9573#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:03:29,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {9573#(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; {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:03:29,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {9577#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ 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; {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) main_~main__sum~0))} is VALID [2022-04-08 04:03:29,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {9581#(and (= 6 (+ (- 4) main_~main__i~0)) (= (+ (* 4 main_~main__i~0) 5) 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; {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 04:03:29,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {9585#(and (= (+ (* 4 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 6 (+ (- 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; {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 main_~main__i~0) (- 3)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:03:29,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {9589#(and (= (+ (- 6) main_~main__i~0) 6) (= (+ (* 4 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; {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 04:03:29,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {9593#(and (= main_~main__sum~0 (+ (- 13) (* 7 main_~main__i~0))) (= 6 (+ (- 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; {9597#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:03:29,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {9597#(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; {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:03:29,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {9601#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ 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; {9605#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:03:29,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {9605#(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; {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:03:29,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {9609#(and (= 17 main_~main__i~0) (= main_~main__sum~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; {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 04:03:29,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {9613#(and (= 136 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} is VALID [2022-04-08 04:03:29,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {9617#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 136))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} is VALID [2022-04-08 04:03:29,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {9621#(and (= (+ (- 3) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 130)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9625#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 04:03:29,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {9625#(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; {9629#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-08 04:03:29,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {9629#(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; {9633#(and (= 21 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 207)))} is VALID [2022-04-08 04:03:29,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#(and (= 21 (+ (- 2) main_~main__i~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; {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= main_~main__i~0 24))} is VALID [2022-04-08 04:03:29,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {9637#(and (= (+ main_~main__sum~0 (- 23)) 253) (= 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; {9641#(and (= (+ (- 1) main_~main__i~0) 24) (= main_~main__sum~0 (+ 275 main_~main__i~0)))} is VALID [2022-04-08 04:03:29,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {9641#(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; {9645#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 04:03:29,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {9645#(and (= 26 main_~main__i~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; {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-08 04:03:29,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {9649#(and (= 325 (+ main_~main__sum~0 (- 26))) (= 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; {9653#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-08 04:03:29,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {9653#(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; {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 04:03:29,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {9657#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 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; {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-08 04:03:29,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {9661#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 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; {9665#(and (<= 30 main_~main__n~0) (<= main_~main__i~0 31) (= main_~main__sum~0 465))} is VALID [2022-04-08 04:03:29,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {9665#(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; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:29,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-08 04:03:29,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-08 04:03:29,960 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-08 04:03:29,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:03:41,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-08 04:03:41,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {9520#false} is VALID [2022-04-08 04:03:41,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {9682#(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; {9669#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:41,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9682#(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-08 04:03:41,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {9519#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {9686#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:03:41,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(1 <= ~main__n~0); {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#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; {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #58#return; {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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_96~0 := 0; {9519#true} is VALID [2022-04-08 04:03:41,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-08 04:03:41,894 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-08 04:03:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:03:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116835761] [2022-04-08 04:03:41,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:03:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457297661] [2022-04-08 04:03:41,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457297661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:03:41,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:03:41,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 5] total 36 [2022-04-08 04:03:41,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:03:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142472722] [2022-04-08 04:03:41,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142472722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:03:41,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:03:41,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 04:03:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992563493] [2022-04-08 04:03:41,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:03:41,896 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-08 04:03:41,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:03:41,896 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-08 04:03:41,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:41,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 04:03:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 04:03:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 04:03:41,966 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-08 04:03:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:46,694 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 04:03:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 04:03:46,694 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-08 04:03:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:03:46,695 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-08 04:03:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 04:03:46,695 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-08 04:03:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 04:03:46,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-08 04:03:46,772 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-08 04:03:46,772 INFO L225 Difference]: With dead ends: 46 [2022-04-08 04:03:46,772 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 04:03:46,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 04:03:46,773 INFO L913 BasicCegarLoop]: 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-08 04:03:46,774 INFO L914 BasicCegarLoop]: 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-08 04:03:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 04:03:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 04:03:46,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:03:46,819 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-08 04:03:46,819 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-08 04:03:46,819 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-08 04:03:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:46,820 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 04:03:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 04:03:46,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:46,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:46,820 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-08 04:03:46,820 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-08 04:03:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:03:46,821 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-08 04:03:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 04:03:46,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:03:46,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:03:46,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:03:46,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:03:46,821 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-08 04:03:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-08 04:03:46,822 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-08 04:03:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:03:46,822 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-08 04:03:46,822 INFO L479 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-08 04:03:46,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-08 04:03:46,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:03:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-08 04:03:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 04:03:46,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:03:46,921 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:03:46,938 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-08 04:03:47,122 WARN L460 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-08 04:03:47,122 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:03:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:03:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 51 times [2022-04-08 04:03:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:03:47,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607719706] [2022-04-08 04:03:47,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:03:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1223454721, now seen corresponding path program 52 times [2022-04-08 04:03:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:03:47,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149595168] [2022-04-08 04:03:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:03:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:03:47,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:03:47,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379256378] [2022-04-08 04:03:47,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:03:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:03:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:03:47,140 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-08 04:03:47,160 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-08 04:03:47,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:03:47,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:03:47,207 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 132 conjunts are in the unsatisfiable core [2022-04-08 04:03:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:03:47,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:03:48,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-08 04:03:48,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#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_96~0 := 0; {10066#true} is VALID [2022-04-08 04:03:48,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-08 04:03:48,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-08 04:03:48,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-08 04:03:48,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#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; {10066#true} is VALID [2022-04-08 04:03:48,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-08 04:03:48,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10092#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:03:48,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {10092#(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; {10096#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:03:48,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {10096#(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; {10100#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:03:48,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {10100#(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; {10104#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:03:48,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {10104#(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; {10108#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 04:03:48,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {10108#(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; {10112#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 6)) 3))} is VALID [2022-04-08 04:03:48,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {10112#(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; {10116#(and (= 5 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 7)))} is VALID [2022-04-08 04:03:48,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {10116#(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; {10120#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:03:48,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {10120#(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; {10124#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:03:48,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#(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; {10128#(and (= 36 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 9))} is VALID [2022-04-08 04:03:48,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {10128#(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; {10132#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:03:48,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {10132#(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; {10136#(and (= 55 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:03:48,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {10136#(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; {10140#(and (= (+ (- 2) main_~main__i~0) 11) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 55))} is VALID [2022-04-08 04:03:48,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {10140#(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; {10144#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:03:48,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {10144#(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; {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:03:48,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {10148#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ 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; {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:03:48,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {10152#(and (= 91 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 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; {10156#(and (= 17 main_~main__i~0) (= 91 (+ (- 45) main_~main__sum~0)))} is VALID [2022-04-08 04:03:48,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {10156#(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; {10160#(and (= 18 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 62))))} is VALID [2022-04-08 04:03:48,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {10160#(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; {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-08 04:03:48,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {10164#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10168#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:03:48,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {10168#(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; {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-08 04:03:48,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} is VALID [2022-04-08 04:03:48,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {10176#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 189)) 20) (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 188))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:03:48,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {10180#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 187)) 20) (= (+ main_~main__sum~0 (- 186) (* (- 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; {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} is VALID [2022-04-08 04:03:48,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {10184#(and (= 21 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 204)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:03:48,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {10188#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 200)) (= 21 (+ (- 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; {10192#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 04:03:48,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {10192#(and (= 26 main_~main__i~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; {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= main_~main__i~0 27))} is VALID [2022-04-08 04:03:48,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {10196#(and (= 325 (+ main_~main__sum~0 (- 26))) (= 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; {10200#(and (= (+ main_~main__sum~0 (- 351)) 27) (= (+ main_~main__sum~0 (- 350)) main_~main__i~0))} is VALID [2022-04-08 04:03:48,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {10200#(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; {10204#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 04:03:48,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {10204#(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; {10208#(and (= 406 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-08 04:03:48,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {10208#(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; {10212#(and (= 31 main_~main__i~0) (= main_~main__sum~0 465))} is VALID [2022-04-08 04:03:48,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {10212#(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; {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:03:48,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {10216#(and (= (+ (- 465) main_~main__sum~0) 31) (<= main_~main__sum~0 (+ 465 main_~main__n~0)) (<= (+ 464 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; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:03:48,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-08 04:03:48,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-08 04:03:48,204 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-08 04:03:48,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:04:02,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-04-08 04:04:02,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10067#false} is VALID [2022-04-08 04:04:02,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {10233#(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; {10220#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:04:02,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10233#(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-08 04:04:02,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:02,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:02,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:02,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:02,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:02,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {10066#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10237#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:03,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume !!(1 <= ~main__n~0); {10066#true} is VALID [2022-04-08 04:04:03,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#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; {10066#true} is VALID [2022-04-08 04:04:03,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call #t~ret5 := main(); {10066#true} is VALID [2022-04-08 04:04:03,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #58#return; {10066#true} is VALID [2022-04-08 04:04:03,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-04-08 04:04:03,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#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_96~0 := 0; {10066#true} is VALID [2022-04-08 04:04:03,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {10066#true} call ULTIMATE.init(); {10066#true} is VALID [2022-04-08 04:04:03,370 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-08 04:04:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:04:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149595168] [2022-04-08 04:04:03,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:04:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379256378] [2022-04-08 04:04:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379256378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:04:03,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:04:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 5] total 37 [2022-04-08 04:04:03,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:04:03,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607719706] [2022-04-08 04:04:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607719706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:04:03,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:04:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-08 04:04:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115878025] [2022-04-08 04:04:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:04:03,371 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-08 04:04:03,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:04:03,371 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-08 04:04:03,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:04:03,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-08 04:04:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:03,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-08 04:04:03,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 04:04:03,462 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-08 04:04:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:10,110 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 04:04:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 04:04:10,110 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-08 04:04:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:04:10,111 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-08 04:04:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-08 04:04:10,112 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-08 04:04:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-08 04:04:10,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-08 04:04:10,225 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-08 04:04:10,226 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:04:10,226 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 04:04:10,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 04:04:10,226 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:04:10,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 04:04:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 04:04:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 04:04:10,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:04:10,274 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-08 04:04:10,274 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-08 04:04:10,274 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-08 04:04:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:10,275 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 04:04:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 04:04:10,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:04:10,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:04:10,275 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-08 04:04:10,275 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-08 04:04:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:10,276 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-08 04:04:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 04:04:10,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:04:10,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:04:10,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:04:10,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:04:10,277 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-08 04:04:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-08 04:04:10,277 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-08 04:04:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:04:10,278 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-08 04:04:10,285 INFO L479 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-08 04:04:10,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-08 04:04:10,504 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-08 04:04:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-08 04:04:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 04:04:10,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:04:10,505 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:04:10,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 04:04:10,705 WARN L460 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-08 04:04:10,705 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:04:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:04:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 53 times [2022-04-08 04:04:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905507010] [2022-04-08 04:04:10,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:04:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash -727671766, now seen corresponding path program 54 times [2022-04-08 04:04:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:04:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100732029] [2022-04-08 04:04:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:04:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:04:10,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:04:10,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728106539] [2022-04-08 04:04:10,721 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:04:10,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:04:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:04:10,722 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-08 04:04:10,723 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-08 04:04:10,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 04:04:10,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:04:10,792 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 136 conjunts are in the unsatisfiable core [2022-04-08 04:04:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:04:10,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:04:11,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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_96~0 := 0; {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#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; {10626#true} is VALID [2022-04-08 04:04:11,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-08 04:04:11,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10652#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:04:11,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {10652#(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; {10656#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:04:11,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#(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; {10660#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:04:11,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {10660#(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; {10664#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:04:11,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {10664#(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; {10668#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-08 04:04:11,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {10668#(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; {10672#(and (= 6 main_~main__i~0) (= main_~main__sum~0 15))} is VALID [2022-04-08 04:04:11,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {10672#(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; {10676#(and (= (+ (- 1) main_~main__i~0) 6) (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:04:11,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {10676#(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; {10680#(and (= 8 main_~main__i~0) (= (+ (- 13) main_~main__sum~0) 15))} is VALID [2022-04-08 04:04:11,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {10680#(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; {10684#(and (= (+ main_~main__sum~0 (- 27)) main_~main__i~0) (= 8 (+ main_~main__sum~0 (- 28))))} is VALID [2022-04-08 04:04:11,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {10684#(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; {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-08 04:04:11,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {10688#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ 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; {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} is VALID [2022-04-08 04:04:11,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {10692#(and (= (+ (- 1) main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 9))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 30)))} is VALID [2022-04-08 04:04:11,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {10696#(and (= 9 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~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; {10700#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 04:04:11,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {10700#(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; {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:04:11,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {10704#(and (= 66 (+ main_~main__sum~0 (- 25))) (= 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; {10708#(and (= (+ (- 1) main_~main__i~0) 14) (= main_~main__sum~0 (+ 90 main_~main__i~0)))} is VALID [2022-04-08 04:04:11,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {10708#(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; {10712#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:04:11,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {10712#(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; {10716#(and (= 17 main_~main__i~0) (= (+ main_~main__sum~0 (- 16)) 120))} is VALID [2022-04-08 04:04:11,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {10716#(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; {10720#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 04:04:11,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {10720#(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; {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 04:04:11,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {10724#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 18))} is VALID [2022-04-08 04:04:11,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {10728#(and (= 153 (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 2) 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; {10732#(and (= 21 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 57))))} is VALID [2022-04-08 04:04:11,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {10732#(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; {10736#(and (= (+ (- 1) main_~main__i~0) 21) (= main_~main__sum~0 (+ 209 main_~main__i~0)))} is VALID [2022-04-08 04:04:11,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {10736#(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; {10740#(and (= main_~main__sum~0 253) (= 23 main_~main__i~0))} is VALID [2022-04-08 04:04:11,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {10740#(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; {10744#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 04:04:11,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {10744#(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; {10748#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-08 04:04:11,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {10748#(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; {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} is VALID [2022-04-08 04:04:11,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {10752#(and (= 26 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 49))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 26))} is VALID [2022-04-08 04:04:11,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {10756#(and (= 276 (+ (- 48) main_~main__sum~0 (* (- 1) main_~main__i~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; {10760#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 04:04:11,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {10760#(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; {10764#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 04:04:11,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {10764#(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; {10768#(and (= main_~main__sum~0 (+ 405 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 29))} is VALID [2022-04-08 04:04:11,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {10768#(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; {10772#(and (= 29 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ 403 (* 2 main_~main__i~0))))} is VALID [2022-04-08 04:04:11,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(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; {10776#(and (= 465 (+ main_~main__sum~0 (- 31))) (= 32 main_~main__i~0))} is VALID [2022-04-08 04:04:11,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {10776#(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; {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} is VALID [2022-04-08 04:04:11,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {10780#(and (<= main_~main__i~0 33) (<= 32 main_~main__n~0) (= main_~main__sum~0 528))} 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; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:04:11,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-08 04:04:11,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-08 04:04:11,898 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-08 04:04:11,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:04:26,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-08 04:04:26,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {10627#false} is VALID [2022-04-08 04:04:26,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {10797#(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; {10784#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:04:26,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10797#(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-08 04:04:26,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:26,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {10801#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:27,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} assume !!(1 <= ~main__n~0); {10626#true} is VALID [2022-04-08 04:04:27,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#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; {10626#true} is VALID [2022-04-08 04:04:27,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret5 := main(); {10626#true} is VALID [2022-04-08 04:04:27,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #58#return; {10626#true} is VALID [2022-04-08 04:04:27,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-08 04:04:27,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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_96~0 := 0; {10626#true} is VALID [2022-04-08 04:04:27,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-08 04:04:27,077 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-08 04:04:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:04:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100732029] [2022-04-08 04:04:27,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:04:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728106539] [2022-04-08 04:04:27,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728106539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:04:27,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:04:27,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 5] total 38 [2022-04-08 04:04:27,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:04:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905507010] [2022-04-08 04:04:27,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905507010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:04:27,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:04:27,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-08 04:04:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709414275] [2022-04-08 04:04:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:04:27,078 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-08 04:04:27,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:04:27,078 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-08 04:04:27,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:04:27,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-08 04:04:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-08 04:04:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 04:04:27,160 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-08 04:04:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:34,191 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 04:04:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 04:04:34,191 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-08 04:04:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:04:34,191 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-08 04:04:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 04:04:34,192 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-08 04:04:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 04:04:34,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-08 04:04:34,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:04:34,289 INFO L225 Difference]: With dead ends: 48 [2022-04-08 04:04:34,289 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 04:04:34,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 04:04:34,290 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:04:34,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 04:04:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 04:04:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 04:04:34,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:04:34,335 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-08 04:04:34,335 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-08 04:04:34,335 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-08 04:04:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:34,335 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 04:04:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 04:04:34,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:04:34,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:04:34,336 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-08 04:04:34,336 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-08 04:04:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:04:34,337 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-08 04:04:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 04:04:34,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:04:34,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:04:34,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:04:34,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:04:34,337 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-08 04:04:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-08 04:04:34,338 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-08 04:04:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:04:34,338 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-08 04:04:34,338 INFO L479 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-08 04:04:34,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-08 04:04:34,484 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-08 04:04:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-08 04:04:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 04:04:34,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:04:34,485 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:04:34,503 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-08 04:04:34,691 WARN L460 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-08 04:04:34,691 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:04:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:04:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 55 times [2022-04-08 04:04:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:34,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1316635885] [2022-04-08 04:04:34,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:04:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1083050719, now seen corresponding path program 56 times [2022-04-08 04:04:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:04:34,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398959192] [2022-04-08 04:04:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:04:34,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:04:34,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:04:34,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201797615] [2022-04-08 04:04:34,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:04:34,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:04:34,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:04:34,715 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-08 04:04:34,743 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-08 04:04:34,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:04:34,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:04:34,795 WARN L261 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 140 conjunts are in the unsatisfiable core [2022-04-08 04:04:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:04:34,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:04:35,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-08 04:04:35,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#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_96~0 := 0; {11199#true} is VALID [2022-04-08 04:04:35,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-08 04:04:35,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-08 04:04:35,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-08 04:04:35,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#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; {11199#true} is VALID [2022-04-08 04:04:35,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-08 04:04:35,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11225#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:04:35,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {11225#(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; {11229#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:04:35,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {11229#(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; {11233#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:04:35,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {11233#(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; {11237#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:04:35,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {11237#(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; {11241#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 04:04:35,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {11241#(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; {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:04:35,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {11245#(and (= 5 (+ main_~main__sum~0 (- 10))) (= (+ (- 9) 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; {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) main_~main__sum~0) main_~main__i~0))} is VALID [2022-04-08 04:04:35,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {11249#(and (= 6 (+ main_~main__sum~0 (- 15))) (= (+ (- 14) 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; {11253#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 12)) (= 6 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:04:35,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#(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; {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:04:35,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {11257#(and (= 6 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 10) (+ 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; {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} is VALID [2022-04-08 04:04:35,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {11261#(and (= 10 main_~main__i~0) (= (+ main_~main__sum~0 (- 17)) 28))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11265#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:04:35,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {11265#(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; {11269#(and (= main_~main__sum~0 (+ main_~main__i~0 54)) (= (+ (- 1) main_~main__i~0) 11))} is VALID [2022-04-08 04:04:35,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {11269#(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; {11273#(and (= 13 main_~main__i~0) (= 66 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 04:04:35,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {11273#(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; {11277#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-08 04:04:35,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {11277#(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; {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-08 04:04:35,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {11281#(and (= (+ 76 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {11285#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:04:35,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {11285#(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; {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:04:35,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {11289#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {11293#(and (= 18 main_~main__i~0) (= (+ main_~main__sum~0 (- 33)) 120))} is VALID [2022-04-08 04:04:35,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {11293#(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; {11297#(and (= 19 main_~main__i~0) (= 120 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-08 04:04:35,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {11297#(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; {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} is VALID [2022-04-08 04:04:35,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {11301#(and (= 20 main_~main__i~0) (= (+ main_~main__sum~0 (- 70)) 120))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} is VALID [2022-04-08 04:04:35,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {11305#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 189))) (= 20 (+ main_~main__sum~0 (- 190))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11309#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 04:04:35,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {11309#(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; {11313#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-08 04:04:35,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {11313#(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; {11317#(and (= (+ 252 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 23))} is VALID [2022-04-08 04:04:35,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {11317#(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; {11321#(and (= 25 main_~main__i~0) (= 276 (+ main_~main__sum~0 (- 24))))} is VALID [2022-04-08 04:04:35,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {11321#(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; {11325#(and (= (+ (- 1) main_~main__i~0) 25) (= 276 (+ main_~main__sum~0 (- 23) (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:04:35,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {11325#(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; {11329#(and (= 276 (+ main_~main__sum~0 (- 75))) (= main_~main__i~0 27))} is VALID [2022-04-08 04:04:35,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {11329#(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; {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 04:04:35,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {11333#(and (= 276 (+ (- 102) main_~main__sum~0)) (= 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; {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 04:04:35,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {11337#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 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; {11341#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-08 04:04:35,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {11341#(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; {11345#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 04:04:35,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {11345#(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; {11349#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-08 04:04:35,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {11349#(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; {11353#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-08 04:04:35,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {11353#(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; {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 33 main_~main__n~0))} is VALID [2022-04-08 04:04:35,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {11357#(and (<= main_~main__i~0 34) (= main_~main__sum~0 561) (<= 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; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:04:35,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-08 04:04:35,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-08 04:04:35,773 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-08 04:04:35,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:04:53,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {11200#false} assume !false; {11200#false} is VALID [2022-04-08 04:04:53,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11200#false} is VALID [2022-04-08 04:04:53,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {11374#(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; {11361#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:04:53,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11374#(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-08 04:04:53,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:53,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {11199#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11378#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:04:54,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {11199#true} assume !!(1 <= ~main__n~0); {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {11199#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; {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {11199#true} call #t~ret5 := main(); {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11199#true} {11199#true} #58#return; {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume true; {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#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_96~0 := 0; {11199#true} is VALID [2022-04-08 04:04:54,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {11199#true} call ULTIMATE.init(); {11199#true} is VALID [2022-04-08 04:04:54,369 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-08 04:04:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:04:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398959192] [2022-04-08 04:04:54,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:04:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201797615] [2022-04-08 04:04:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201797615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:04:54,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:04:54,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 5] total 39 [2022-04-08 04:04:54,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:04:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1316635885] [2022-04-08 04:04:54,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1316635885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:04:54,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:04:54,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-08 04:04:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341495924] [2022-04-08 04:04:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:04:54,370 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-08 04:04:54,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:04:54,370 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-08 04:04:54,494 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-08 04:04:54,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-08 04:04:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:04:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-08 04:04:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 04:04:54,496 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-08 04:05:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:02,142 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 04:05:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 04:05:02,142 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-08 04:05:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:05:02,142 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-08 04:05:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-08 04:05:02,143 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-08 04:05:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-08 04:05:02,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-08 04:05:02,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:05:02,230 INFO L225 Difference]: With dead ends: 49 [2022-04-08 04:05:02,230 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 04:05:02,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 33 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 04:05:02,231 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:05:02,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 04:05:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 04:05:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 04:05:02,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:05:02,281 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-08 04:05:02,281 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-08 04:05:02,281 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-08 04:05:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:02,282 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 04:05:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 04:05:02,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:02,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:02,282 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-08 04:05:02,282 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-08 04:05:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:02,283 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-08 04:05:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 04:05:02,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:02,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:02,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:05:02,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:05:02,283 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-08 04:05:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-08 04:05:02,284 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-08 04:05:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:05:02,284 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-08 04:05:02,284 INFO L479 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-08 04:05:02,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-08 04:05:02,520 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-08 04:05:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-08 04:05:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 04:05:02,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:05:02,521 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:05:02,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 04:05:02,721 WARN L460 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-08 04:05:02,721 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:05:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:05:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 57 times [2022-04-08 04:05:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:02,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552083729] [2022-04-08 04:05:02,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:05:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 785103626, now seen corresponding path program 58 times [2022-04-08 04:05:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:05:02,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967721147] [2022-04-08 04:05:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:05:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:05:02,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:05:02,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362357616] [2022-04-08 04:05:02,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:05:02,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:05:02,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:05:02,741 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-08 04:05:02,758 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-08 04:05:02,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:05:02,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:05:02,822 WARN L261 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 144 conjunts are in the unsatisfiable core [2022-04-08 04:05:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:05:02,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:05:03,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#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_96~0 := 0; {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#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; {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-08 04:05:03,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11811#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:05:03,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(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; {11815#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:05:03,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {11815#(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; {11819#(and (= 1 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-08 04:05:03,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {11819#(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; {11823#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) 1))} is VALID [2022-04-08 04:05:03,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {11823#(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; {11827#(and (= (+ (- 9) main_~main__sum~0) 1) (= 5 main_~main__i~0))} is VALID [2022-04-08 04:05:03,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {11827#(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; {11831#(and (= (+ (- 1) main_~main__i~0) 5) (= main_~main__sum~0 (+ 9 main_~main__i~0)))} is VALID [2022-04-08 04:05:03,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#(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; {11835#(and (= (+ main_~main__sum~0 (- 6)) 15) (= 7 main_~main__i~0))} is VALID [2022-04-08 04:05:03,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {11835#(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; {11839#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 5)) 15) (= (+ (- 1) main_~main__i~0) 7))} is VALID [2022-04-08 04:05:03,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {11839#(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; {11843#(and (= (+ main_~main__sum~0 (- 21)) 15) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:05:03,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {11843#(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; {11847#(and (= 10 main_~main__i~0) (= 15 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 04:05:03,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {11847#(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; {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 1) main_~main__i~0) 10))} is VALID [2022-04-08 04:05:03,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {11851#(and (= 15 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 29))) (= (+ (- 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; {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 51) main_~main__sum~0)))} is VALID [2022-04-08 04:05:03,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(and (= 12 main_~main__i~0) (= 15 (+ (- 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; {11859#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:05:03,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {11859#(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; {11863#(and (= 91 main_~main__sum~0) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:05:03,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {11863#(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; {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:05:03,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {11867#(and (= (+ (- 1) main_~main__i~0) 14) (= 91 (+ 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; {11871#(and (= 91 (+ main_~main__sum~0 (- 29))) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:05:03,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {11871#(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; {11875#(and (= 91 (+ main_~main__sum~0 (- 28) (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:05:03,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {11875#(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; {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} is VALID [2022-04-08 04:05:03,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(and (= 16 (+ (- 2) main_~main__i~0)) (= 91 (+ main_~main__sum~0 (- 26) (* (- 2) main_~main__i~0))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} is VALID [2022-04-08 04:05:03,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {11883#(and (= 19 main_~main__i~0) (= 91 (+ main_~main__sum~0 (- 80))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11887#(and (= 20 main_~main__i~0) (= 190 main_~main__sum~0))} is VALID [2022-04-08 04:05:03,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {11887#(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; {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} is VALID [2022-04-08 04:05:03,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {11891#(and (= 21 main_~main__i~0) (= main_~main__sum~0 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} is VALID [2022-04-08 04:05:03,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {11895#(and (= (+ (- 1) main_~main__i~0) 21) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} is VALID [2022-04-08 04:05:03,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {11899#(and (= 23 main_~main__i~0) (= (+ main_~main__sum~0 (- 43)) 210))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11903#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-08 04:05:03,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {11903#(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; {11907#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 04:05:03,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {11907#(and (= (+ main_~main__sum~0 (- 276)) 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; {11911#(and (= (+ (- 1) main_~main__i~0) 25) (= main_~main__sum~0 (+ 299 main_~main__i~0)))} is VALID [2022-04-08 04:05:03,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {11911#(and (= (+ (- 1) main_~main__i~0) 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; {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 25))} is VALID [2022-04-08 04:05:03,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {11915#(and (= (+ 298 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {11919#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 04:05:03,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {11919#(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; {11923#(and (= 378 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 04:05:03,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {11923#(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; {11927#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-08 04:05:03,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {11927#(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; {11931#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 04:05:03,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {11931#(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; {11935#(and (= (+ main_~main__sum~0 (- 61)) 435) (= 32 main_~main__i~0))} is VALID [2022-04-08 04:05:03,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {11935#(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; {11939#(and (= (+ main_~main__sum~0 (- 93)) 435) (= 33 main_~main__i~0))} is VALID [2022-04-08 04:05:03,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {11939#(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; {11943#(and (= (+ main_~main__sum~0 (- 126)) 435) (= 34 main_~main__i~0))} is VALID [2022-04-08 04:05:03,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {11943#(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; {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= main_~main__i~0 35))} is VALID [2022-04-08 04:05:03,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {11947#(and (<= 34 main_~main__n~0) (= 435 (+ main_~main__sum~0 (- 160))) (<= 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; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:05:03,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-08 04:05:03,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-08 04:05:03,851 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-08 04:05:03,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:05:22,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {11786#false} assume !false; {11786#false} is VALID [2022-04-08 04:05:22,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {11786#false} is VALID [2022-04-08 04:05:22,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {11964#(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; {11951#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:05:22,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11964#(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-08 04:05:22,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {11785#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {11968#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:22,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {11785#true} assume !!(1 <= ~main__n~0); {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {11785#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; {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {11785#true} call #t~ret5 := main(); {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11785#true} {11785#true} #58#return; {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {11785#true} assume true; {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {11785#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_96~0 := 0; {11785#true} is VALID [2022-04-08 04:05:22,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {11785#true} call ULTIMATE.init(); {11785#true} is VALID [2022-04-08 04:05:22,631 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-08 04:05:22,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:05:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967721147] [2022-04-08 04:05:22,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:05:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362357616] [2022-04-08 04:05:22,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362357616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:05:22,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:05:22,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 5] total 40 [2022-04-08 04:05:22,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:05:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552083729] [2022-04-08 04:05:22,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552083729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:05:22,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:05:22,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-08 04:05:22,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844681377] [2022-04-08 04:05:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:05:22,632 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-08 04:05:22,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:05:22,632 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-08 04:05:22,713 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-08 04:05:22,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-08 04:05:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-08 04:05:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 04:05:22,715 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-08 04:05:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:31,677 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 04:05:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 04:05:31,677 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-08 04:05:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:05:31,677 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-08 04:05:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-08 04:05:31,678 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-08 04:05:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-08 04:05:31,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 50 transitions. [2022-04-08 04:05:31,815 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-08 04:05:31,815 INFO L225 Difference]: With dead ends: 50 [2022-04-08 04:05:31,815 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 04:05:31,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 04:05:31,816 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:05:31,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 298 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 04:05:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 04:05:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 04:05:31,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:05:31,865 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-08 04:05:31,865 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-08 04:05:31,865 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-08 04:05:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:31,866 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 04:05:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 04:05:31,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:31,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:31,866 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-08 04:05:31,866 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-08 04:05:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:05:31,866 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-08 04:05:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 04:05:31,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:05:31,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:05:31,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:05:31,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:05:31,867 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-08 04:05:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-08 04:05:31,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-08 04:05:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:05:31,868 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-08 04:05:31,868 INFO L479 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-08 04:05:31,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-08 04:05:32,016 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-08 04:05:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-08 04:05:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 04:05:32,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:05:32,017 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:05:32,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-08 04:05:32,217 WARN L460 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-08 04:05:32,218 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:05:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:05:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 59 times [2022-04-08 04:05:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:32,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852281619] [2022-04-08 04:05:32,218 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:05:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1431653823, now seen corresponding path program 60 times [2022-04-08 04:05:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:05:32,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120735194] [2022-04-08 04:05:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:05:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:05:32,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:05:32,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966386798] [2022-04-08 04:05:32,251 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:05:32,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:05:32,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:05:32,252 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-08 04:05:32,253 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-08 04:05:32,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 04:05:32,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:05:32,319 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 148 conjunts are in the unsatisfiable core [2022-04-08 04:05:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:05:32,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:05:33,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-08 04:05:33,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#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_96~0 := 0; {12384#true} is VALID [2022-04-08 04:05:33,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-08 04:05:33,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-08 04:05:33,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-08 04:05:33,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#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; {12384#true} is VALID [2022-04-08 04:05:33,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-08 04:05:33,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12410#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:05:33,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {12410#(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; {12414#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-08 04:05:33,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {12414#(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; {12418#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:05:33,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {12418#(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; {12422#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:05:33,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {12422#(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; {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:05:33,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {12426#(and (= (+ (- 1) main_~main__i~0) 4) (= 3 (+ (- 2) 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; {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-08 04:05:33,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {12430#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 3)) (= (+ (- 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; {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 1) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:05:33,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {12434#(and (= (+ (- 3) main_~main__i~0) 4) (= (+ (* 2 main_~main__i~0) 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; {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:05:33,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {12438#(and (= (+ (- 4) main_~main__i~0) 4) (= (+ (- 1) (* 2 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; {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:05:33,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {12442#(and (= (+ (- 5) main_~main__i~0) 4) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 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; {12446#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:05:33,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {12446#(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; {12450#(and (= 45 (+ main_~main__sum~0 (- 10))) (= 11 main_~main__i~0))} is VALID [2022-04-08 04:05:33,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {12450#(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; {12454#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 04:05:33,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {12454#(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; {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:05:33,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {12458#(and (= (+ (- 1) main_~main__i~0) 12) (= 45 (+ (- 20) 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; {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:05:33,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {12462#(and (= (+ main_~main__sum~0 (- 46)) 45) (= 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; {12466#(and (= (+ main_~main__sum~0 (- 91)) 14) (= (+ main_~main__sum~0 (- 90)) main_~main__i~0))} is VALID [2022-04-08 04:05:33,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {12466#(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; {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} is VALID [2022-04-08 04:05:33,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {12470#(and (= (+ (- 1) main_~main__i~0) (+ (- 89) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 90)) 14))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:05:33,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {12474#(and (= 17 main_~main__i~0) (= main_~main__sum~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; {12478#(and (= 18 main_~main__i~0) (= main_~main__sum~0 153))} is VALID [2022-04-08 04:05:33,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {12478#(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; {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 18))} is VALID [2022-04-08 04:05:33,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {12482#(and (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {12486#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 04:05:33,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {12486#(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; {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} is VALID [2022-04-08 04:05:33,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {12490#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12494#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} is VALID [2022-04-08 04:05:33,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {12494#(and (= 22 main_~main__i~0) (= 153 (+ 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; {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 22))} is VALID [2022-04-08 04:05:33,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#(and (= 153 (+ (- 77) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 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; {12502#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-08 04:05:33,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(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; {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 24))} is VALID [2022-04-08 04:05:33,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {12506#(and (= 276 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) 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; {12510#(and (= (+ (- 2) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 273) main_~main__sum~0))} is VALID [2022-04-08 04:05:33,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#(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; {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:05:33,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {12514#(and (= (+ (- 3) main_~main__i~0) 24) (= (+ (* 2 main_~main__i~0) 271) (+ 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; {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 28 main_~main__i~0))} is VALID [2022-04-08 04:05:33,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {12518#(and (= 325 (+ (- 53) main_~main__sum~0)) (= 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; {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 04:05:33,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {12522#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 52))) (= (+ (- 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; {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} is VALID [2022-04-08 04:05:33,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {12526#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~0) 30))} is VALID [2022-04-08 04:05:33,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {12530#(and (= (+ (- 109) main_~main__sum~0 (* (- 1) main_~main__i~0)) 325) (= (+ (- 1) main_~main__i~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; {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 32 main_~main__i~0))} is VALID [2022-04-08 04:05:33,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {12534#(and (= 325 (+ main_~main__sum~0 (- 171))) (= 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; {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} is VALID [2022-04-08 04:05:33,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {12538#(and (= 33 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 203))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} is VALID [2022-04-08 04:05:33,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {12542#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 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; {12546#(and (= main_~main__i~0 (+ (- 560) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 561)) 34))} is VALID [2022-04-08 04:05:33,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {12546#(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; {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 main_~main__n~0))} is VALID [2022-04-08 04:05:33,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {12550#(and (= 630 main_~main__sum~0) (<= main_~main__i~0 36) (<= 35 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; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:05:33,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-08 04:05:33,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-08 04:05:33,415 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-08 04:05:33,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:05:57,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {12385#false} assume !false; {12385#false} is VALID [2022-04-08 04:05:57,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12385#false} is VALID [2022-04-08 04:05:57,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {12567#(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; {12554#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:05:57,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12567#(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-08 04:05:57,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:57,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {12384#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {12571#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:05:58,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {12384#true} assume !!(1 <= ~main__n~0); {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {12384#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; {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {12384#true} call #t~ret5 := main(); {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12384#true} {12384#true} #58#return; {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {12384#true} assume true; {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {12384#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_96~0 := 0; {12384#true} is VALID [2022-04-08 04:05:58,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {12384#true} call ULTIMATE.init(); {12384#true} is VALID [2022-04-08 04:05:58,371 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-08 04:05:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:05:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120735194] [2022-04-08 04:05:58,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:05:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966386798] [2022-04-08 04:05:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966386798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:05:58,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:05:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 5] total 41 [2022-04-08 04:05:58,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:05:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852281619] [2022-04-08 04:05:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852281619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:05:58,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:05:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-08 04:05:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264018376] [2022-04-08 04:05:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:05:58,373 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-08 04:05:58,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:05:58,373 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-08 04:05:58,555 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-08 04:05:58,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-08 04:05:58,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:05:58,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-08 04:05:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 04:05:58,557 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-08 04:06:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:15,814 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 04:06:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 04:06:15,815 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-08 04:06:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:06:15,815 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-08 04:06:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-08 04:06:15,816 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-08 04:06:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-08 04:06:15,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 51 transitions. [2022-04-08 04:06:16,111 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-08 04:06:16,112 INFO L225 Difference]: With dead ends: 51 [2022-04-08 04:06:16,112 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 04:06:16,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 04:06:16,113 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 8.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:06:16,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-08 04:06:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 04:06:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 04:06:16,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:06:16,167 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-08 04:06:16,167 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-08 04:06:16,168 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-08 04:06:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:16,168 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 04:06:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 04:06:16,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:16,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:16,169 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-08 04:06:16,169 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-08 04:06:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:06:16,169 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-08 04:06:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 04:06:16,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:06:16,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:06:16,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:06:16,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:06:16,169 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-08 04:06:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-08 04:06:16,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-08 04:06:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:06:16,170 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-08 04:06:16,170 INFO L479 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-08 04:06:16,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-08 04:06:16,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:06:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-08 04:06:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 04:06:16,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:06:16,432 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:06:16,449 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-08 04:06:16,635 WARN L460 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-08 04:06:16,635 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:06:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:06:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 61 times [2022-04-08 04:06:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081847930] [2022-04-08 04:06:16,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:06:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1431658006, now seen corresponding path program 62 times [2022-04-08 04:06:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:06:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954951394] [2022-04-08 04:06:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:06:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:06:16,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:06:16,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597066578] [2022-04-08 04:06:16,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:06:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:06:16,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:06:16,664 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-08 04:06:16,665 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-08 04:06:16,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:06:16,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:06:16,736 WARN L261 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 152 conjunts are in the unsatisfiable core [2022-04-08 04:06:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:06:16,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:06:18,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#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_96~0 := 0; {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#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; {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-08 04:06:18,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13022#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:06:18,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {13022#(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; {13026#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:06:18,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {13026#(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; {13030#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-08 04:06:18,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {13030#(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; {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) (- 6))))} is VALID [2022-04-08 04:06:18,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {13034#(and (= (+ (- 3) main_~main__i~0) 1) (= 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; {13038#(and (= main_~main__sum~0 (+ (* 4 main_~main__i~0) (- 10))) (= (+ (- 4) main_~main__i~0) 1))} is VALID [2022-04-08 04:06:18,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {13038#(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; {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 4 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:06:18,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {13042#(and (= (+ (- 5) main_~main__i~0) 1) (= (+ (- 14) (* 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; {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)))} is VALID [2022-04-08 04:06:18,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {13046#(and (= (+ (- 6) main_~main__i~0) 1) (= (+ (* 4 main_~main__i~0) (- 18)) (+ 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; {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 main_~main__i~0) (- 22))))} is VALID [2022-04-08 04:06:18,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {13050#(and (= (+ (- 7) main_~main__i~0) 1) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 4 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; {13054#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:06:18,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {13054#(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; {13058#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:06:18,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {13058#(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; {13062#(and (= (+ (- 1) main_~main__i~0) 10) (= main_~main__sum~0 (+ 44 main_~main__i~0)))} is VALID [2022-04-08 04:06:18,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {13062#(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; {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:06:18,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {13066#(and (= (+ (- 2) main_~main__i~0) 10) (= (+ 43 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; {13070#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 04:06:18,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {13070#(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; {13074#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:06:18,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {13074#(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; {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} is VALID [2022-04-08 04:06:18,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {13078#(and (= (+ (- 1) main_~main__i~0) 14) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 35)) 55))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 14 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:06:18,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {13082#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 33)) 55) (= 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; {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:06:18,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {13086#(and (= 17 main_~main__i~0) (= main_~main__sum~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; {13090#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 04:06:18,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {13090#(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; {13094#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 04:06:18,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {13094#(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; {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-08 04:06:18,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {13098#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) main_~main__i~0) 20))} is VALID [2022-04-08 04:06:18,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {13102#(and (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 18)) 171) (= (+ (- 1) 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; {13106#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 187)) (= (+ (- 2) main_~main__i~0) 20))} is VALID [2022-04-08 04:06:18,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {13106#(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; {13110#(and (= 23 main_~main__i~0) (= 231 (+ main_~main__sum~0 (- 22))))} is VALID [2022-04-08 04:06:18,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {13110#(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; {13114#(and (= main_~main__sum~0 276) (= main_~main__i~0 24))} is VALID [2022-04-08 04:06:18,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {13114#(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; {13118#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 04:06:18,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {13118#(and (= (+ main_~main__sum~0 (- 276)) 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; {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) main_~main__sum~0 (* (- 1) main_~main__i~0))))} is VALID [2022-04-08 04:06:18,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {13122#(and (= (+ main_~main__sum~0 (- 275) (* (- 1) main_~main__i~0)) 24) (= (+ (- 1) main_~main__i~0) (+ (- 274) 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; {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} is VALID [2022-04-08 04:06:18,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {13126#(and (= (+ (- 2) main_~main__i~0) (+ (- 272) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 273)) 24))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~0)) (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:06:18,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {13130#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 270)) 24) (= (+ (- 269) main_~main__sum~0 (* (- 3) main_~main__i~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; {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 5 main_~main__i~0))))} is VALID [2022-04-08 04:06:18,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {13134#(and (= (+ (- 5) main_~main__i~0) 24) (= main_~main__sum~0 (+ 261 (* 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; {13138#(and (= 30 main_~main__i~0) (= main_~main__sum~0 435))} is VALID [2022-04-08 04:06:18,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {13138#(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; {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ main_~main__sum~0 (- 435))))} is VALID [2022-04-08 04:06:18,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {13142#(and (= (+ main_~main__sum~0 (- 434)) main_~main__i~0) (= 30 (+ 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; {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} is VALID [2022-04-08 04:06:18,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {13146#(and (= (+ (- 1) main_~main__i~0) (+ (- 433) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 434)) 30))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 2) main_~main__i~0)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:06:18,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {13150#(and (= 30 (+ (- 432) main_~main__sum~0 (* (- 2) main_~main__i~0))) (= (+ main_~main__sum~0 (- 431) (* (- 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; {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} is VALID [2022-04-08 04:06:18,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {13154#(and (= 30 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 425)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13158#(and (= (+ (* 5 main_~main__i~0) 420) main_~main__sum~0) (= 30 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 04:06:18,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {13158#(and (= (+ (* 5 main_~main__i~0) 420) 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; {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 5 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:06:18,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {13162#(and (= (+ (- 6) main_~main__i~0) 30) (= (+ 415 (* 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; {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 main_~main__n~0))} is VALID [2022-04-08 04:06:18,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {13166#(and (<= main_~main__i~0 37) (= main_~main__sum~0 666) (<= 36 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; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:06:18,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-08 04:06:18,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-08 04:06:18,174 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-08 04:06:18,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:06:57,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {12997#false} assume !false; {12997#false} is VALID [2022-04-08 04:06:57,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {12997#false} is VALID [2022-04-08 04:06:57,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {13183#(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; {13170#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:06:57,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13183#(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-08 04:06:57,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:57,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {12996#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13187#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:06:58,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {12996#true} assume !!(1 <= ~main__n~0); {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {12996#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; {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {12996#true} call #t~ret5 := main(); {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12996#true} {12996#true} #58#return; {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {12996#true} assume true; {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {12996#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_96~0 := 0; {12996#true} is VALID [2022-04-08 04:06:58,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {12996#true} call ULTIMATE.init(); {12996#true} is VALID [2022-04-08 04:06:58,713 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-08 04:06:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:06:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954951394] [2022-04-08 04:06:58,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:06:58,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597066578] [2022-04-08 04:06:58,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597066578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:06:58,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:06:58,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 5] total 42 [2022-04-08 04:06:58,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:06:58,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081847930] [2022-04-08 04:06:58,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081847930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:06:58,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:06:58,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-08 04:06:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776000893] [2022-04-08 04:06:58,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:06:58,715 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-08 04:06:58,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:06:58,715 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-08 04:06:59,004 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-08 04:06:59,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-08 04:06:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:06:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-08 04:06:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 04:06:59,005 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-08 04:07:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:31,946 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 04:07:31,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 04:07:31,947 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-08 04:07:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:07:31,947 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-08 04:07:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-08 04:07:31,948 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-08 04:07:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-08 04:07:31,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 52 transitions. [2022-04-08 04:07:32,372 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-08 04:07:32,373 INFO L225 Difference]: With dead ends: 52 [2022-04-08 04:07:32,373 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 04:07:32,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 04:07:32,374 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s 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, 16.9s IncrementalHoareTripleChecker+Time [2022-04-08 04:07:32,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2022-04-08 04:07:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 04:07:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 04:07:32,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:07:32,441 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-08 04:07:32,441 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-08 04:07:32,441 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-08 04:07:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:32,442 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 04:07:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 04:07:32,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:32,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:32,442 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-08 04:07:32,442 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-08 04:07:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:07:32,443 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-08 04:07:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 04:07:32,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:07:32,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:07:32,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:07:32,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:07:32,443 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-08 04:07:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-08 04:07:32,444 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-08 04:07:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:07:32,444 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-08 04:07:32,444 INFO L479 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-08 04:07:32,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-08 04:07:32,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:07:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-08 04:07:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 04:07:32,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:07:32,875 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:07:32,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-08 04:07:33,075 WARN L460 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-08 04:07:33,075 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:07:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:07:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 63 times [2022-04-08 04:07:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:07:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140132808] [2022-04-08 04:07:33,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:07:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1431787679, now seen corresponding path program 64 times [2022-04-08 04:07:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:07:33,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106080799] [2022-04-08 04:07:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:07:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:07:33,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:07:33,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461953432] [2022-04-08 04:07:33,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:07:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:07:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:07:33,104 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-08 04:07:33,105 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-08 04:07:33,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:07:33,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:07:33,224 WARN L261 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-08 04:07:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:07:33,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:07:34,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#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_96~0 := 0; {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#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; {13621#true} is VALID [2022-04-08 04:07:34,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-08 04:07:34,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13647#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:07:34,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {13647#(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; {13651#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:07:34,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {13651#(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; {13655#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:07:34,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {13655#(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; {13659#(and (= (+ main_~main__sum~0 (- 3)) 3) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:07:34,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {13659#(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; {13663#(and (= (+ main_~main__sum~0 (- 6)) 4) (= (+ main_~main__sum~0 (- 5)) main_~main__i~0))} is VALID [2022-04-08 04:07:34,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {13663#(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; {13667#(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-08 04:07:34,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {13667#(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; {13671#(and (= (+ (- 3) main_~main__i~0) 4) (= main_~main__sum~0 (* 3 main_~main__i~0)))} is VALID [2022-04-08 04:07:34,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {13671#(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; {13675#(and (= 8 main_~main__i~0) (= main_~main__sum~0 28))} is VALID [2022-04-08 04:07:34,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#(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; {13679#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:07:34,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {13679#(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; {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ main_~main__sum~0 (- 35)) main_~main__i~0))} is VALID [2022-04-08 04:07:34,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {13683#(and (= 9 (+ main_~main__sum~0 (- 36))) (= (+ 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; {13687#(and (= 9 (+ (- 2) main_~main__i~0)) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 33)))} is VALID [2022-04-08 04:07:34,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {13687#(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; {13691#(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-08 04:07:34,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {13691#(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; {13695#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 04:07:34,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {13695#(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; {13699#(and (= main_~main__sum~0 (+ 77 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 13))} is VALID [2022-04-08 04:07:34,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {13699#(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; {13703#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 75)) (= (+ (- 2) main_~main__i~0) 13))} is VALID [2022-04-08 04:07:34,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {13703#(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; {13707#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:07:34,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {13707#(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; {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:07:34,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {13711#(and (= 120 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 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; {13715#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:07:34,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {13715#(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; {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:07:34,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {13719#(and (= 16 (+ (- 3) main_~main__i~0)) (= (+ (* 2 main_~main__i~0) 115) (+ 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; {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} is VALID [2022-04-08 04:07:34,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {13723#(and (= 16 (+ (- 4) main_~main__i~0)) (= main_~main__sum~0 (+ (* 4 main_~main__i~0) 110)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13727#(and (= 21 main_~main__i~0) (= 190 (+ (- 20) main_~main__sum~0)))} is VALID [2022-04-08 04:07:34,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {13727#(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; {13731#(and (= 22 main_~main__i~0) (= main_~main__sum~0 231))} is VALID [2022-04-08 04:07:34,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {13731#(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; {13735#(and (= (+ main_~main__sum~0 (- 231)) 22) (= (+ main_~main__sum~0 (- 230)) main_~main__i~0))} is VALID [2022-04-08 04:07:34,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {13735#(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; {13739#(and (= (+ main_~main__sum~0 (- 252)) main_~main__i~0) (= 23 (+ main_~main__sum~0 (- 253))))} is VALID [2022-04-08 04:07:34,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {13739#(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; {13743#(and (= (+ main_~main__sum~0 (- 276)) 24) (= (+ main_~main__sum~0 (- 275)) main_~main__i~0))} is VALID [2022-04-08 04:07:34,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {13743#(and (= (+ main_~main__sum~0 (- 276)) 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; {13747#(and (= 26 main_~main__i~0) (= main_~main__sum~0 325))} is VALID [2022-04-08 04:07:34,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {13747#(and (= 26 main_~main__i~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; {13751#(and (= (+ (- 1) main_~main__i~0) 26) (= main_~main__sum~0 (+ 324 main_~main__i~0)))} is VALID [2022-04-08 04:07:34,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {13751#(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; {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 28 main_~main__i~0))} is VALID [2022-04-08 04:07:34,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {13755#(and (= (+ main_~main__sum~0 (- 27)) 351) (= 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; {13759#(and (= main_~main__sum~0 406) (= 29 main_~main__i~0))} is VALID [2022-04-08 04:07:34,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(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; {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 30 main_~main__i~0))} is VALID [2022-04-08 04:07:34,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {13763#(and (= 406 (+ main_~main__sum~0 (- 29))) (= 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; {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} is VALID [2022-04-08 04:07:34,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {13767#(and (= 31 main_~main__i~0) (= (+ main_~main__sum~0 (- 59)) 406))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-08 04:07:34,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {13771#(and (= main_~main__sum~0 (+ 464 main_~main__i~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; {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:07:34,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {13775#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 34 main_~main__i~0))} is VALID [2022-04-08 04:07:34,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {13779#(and (= (+ main_~main__sum~0 (- 33)) 528) (= 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; {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-08 04:07:34,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {13783#(and (= (+ (- 67) main_~main__sum~0) 528) (= 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; {13787#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-08 04:07:34,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {13787#(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; {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} is VALID [2022-04-08 04:07:34,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {13791#(and (= 37 main_~main__i~0) (= 630 (+ main_~main__sum~0 (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= main_~main__i~0 38))} is VALID [2022-04-08 04:07:34,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {13795#(and (<= 37 main_~main__n~0) (= 630 (+ main_~main__sum~0 (- 73))) (<= 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; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:07:34,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-08 04:07:34,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-08 04:07:34,752 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-08 04:07:34,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:08:41,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {13622#false} assume !false; {13622#false} is VALID [2022-04-08 04:08:41,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {13622#false} is VALID [2022-04-08 04:08:41,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {13812#(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; {13799#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:08:41,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13812#(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-08 04:08:41,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:41,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {13621#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {13816#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:08:42,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} assume !!(1 <= ~main__n~0); {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#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; {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {13621#true} call #t~ret5 := main(); {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13621#true} {13621#true} #58#return; {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume true; {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#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_96~0 := 0; {13621#true} is VALID [2022-04-08 04:08:42,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {13621#true} call ULTIMATE.init(); {13621#true} is VALID [2022-04-08 04:08:42,595 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-08 04:08:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106080799] [2022-04-08 04:08:42,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:08:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461953432] [2022-04-08 04:08:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461953432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:08:42,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:08:42,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 5] total 43 [2022-04-08 04:08:42,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140132808] [2022-04-08 04:08:42,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140132808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:42,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:42,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-08 04:08:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356540940] [2022-04-08 04:08:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:42,597 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-08 04:08:42,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:42,597 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-08 04:08:42,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:42,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-08 04:08:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:42,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-08 04:08:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1685, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 04:08:42,941 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-08 04:09:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:16,288 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-08 04:09:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 04:09:16,288 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-08 04:09:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:16,289 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-08 04:09:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-08 04:09:16,291 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-08 04:09:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-08 04:09:16,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2022-04-08 04:09:16,669 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-08 04:09:16,670 INFO L225 Difference]: With dead ends: 53 [2022-04-08 04:09:16,670 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 04:09:16,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 37 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 04:09:16,671 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s 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, 17.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:16,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 322 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2022-04-08 04:09:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 04:09:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 04:09:16,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:16,739 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-08 04:09:16,739 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-08 04:09:16,739 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-08 04:09:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:16,740 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 04:09:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 04:09:16,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:16,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:16,741 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-08 04:09:16,741 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-08 04:09:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:16,742 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-08 04:09:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 04:09:16,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:16,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:16,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:16,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:16,742 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-08 04:09:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-08 04:09:16,743 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-08 04:09:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:16,743 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-08 04:09:16,743 INFO L479 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-08 04:09:16,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-08 04:09:17,141 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-08 04:09:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-08 04:09:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 04:09:17,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:17,142 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:17,166 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-08 04:09:17,355 WARN L460 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-08 04:09:17,355 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 65 times [2022-04-08 04:09:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:17,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712882352] [2022-04-08 04:09:17,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1435807542, now seen corresponding path program 66 times [2022-04-08 04:09:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:17,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285999091] [2022-04-08 04:09:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:17,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:09:17,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137913316] [2022-04-08 04:09:17,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:09:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:09:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:09:17,378 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-08 04:09:17,380 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-08 04:09:17,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-08 04:09:17,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:09:17,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 160 conjunts are in the unsatisfiable core [2022-04-08 04:09:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:17,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:09:18,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#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_96~0 := 0; {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#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; {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-08 04:09:18,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14285#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:09:18,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#(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; {14289#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:09:18,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {14289#(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; {14293#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:09:18,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {14293#(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; {14297#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-08 04:09:18,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {14297#(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; {14301#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:09:18,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {14301#(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; {14305#(and (= 6 main_~main__i~0) (= (+ main_~main__sum~0 (- 5)) 10))} is VALID [2022-04-08 04:09:18,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {14305#(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; {14309#(and (= (+ (- 1) main_~main__i~0) 6) (= (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 4)) 10))} is VALID [2022-04-08 04:09:18,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {14309#(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; {14313#(and (= (+ main_~main__sum~0 (- 18)) 10) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:09:18,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {14313#(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; {14317#(and (= (+ main_~main__sum~0 (- 26)) 10) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:09:18,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {14317#(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; {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 25))))} is VALID [2022-04-08 04:09:18,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {14321#(and (= (+ (- 1) main_~main__i~0) 9) (= 10 (+ main_~main__sum~0 (* (- 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; {14325#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:09:18,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {14325#(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; {14329#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:09:18,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {14329#(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; {14333#(and (= 12 (+ main_~main__sum~0 (- 66))) (= (+ main_~main__sum~0 (- 65)) main_~main__i~0))} is VALID [2022-04-08 04:09:18,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {14333#(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; {14337#(and (= (+ (* 2 main_~main__i~0) 63) main_~main__sum~0) (= (+ (- 2) main_~main__i~0) 12))} is VALID [2022-04-08 04:09:18,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {14337#(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; {14341#(and (= 91 (+ (- 14) main_~main__sum~0)) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:09:18,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {14341#(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; {14345#(and (= main_~main__sum~0 120) (= 16 main_~main__i~0))} is VALID [2022-04-08 04:09:18,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {14345#(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; {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:09:18,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {14349#(and (= 17 main_~main__i~0) (= main_~main__sum~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; {14353#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 04:09:18,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {14353#(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; {14357#(and (= (+ (- 2) main_~main__i~0) 17) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 133)))} is VALID [2022-04-08 04:09:18,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {14357#(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; {14361#(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-08 04:09:18,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {14361#(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; {14365#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-08 04:09:18,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {14365#(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; {14369#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 04:09:18,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {14369#(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; {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-08 04:09:18,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {14373#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:09:18,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {14377#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} is VALID [2022-04-08 04:09:18,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {14381#(and (= 22 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 225)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14385#(and (= 26 main_~main__i~0) (= (+ main_~main__sum~0 (- 25)) 300))} is VALID [2022-04-08 04:09:18,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {14385#(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; {14389#(and (= (+ (- 51) main_~main__sum~0) 300) (= main_~main__i~0 27))} is VALID [2022-04-08 04:09:18,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {14389#(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; {14393#(and (= 28 main_~main__i~0) (= main_~main__sum~0 378))} is VALID [2022-04-08 04:09:18,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {14393#(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; {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 28))} is VALID [2022-04-08 04:09:18,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {14397#(and (= main_~main__sum~0 (+ 377 main_~main__i~0)) (= (+ (- 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; {14401#(and (= (+ (- 2) main_~main__i~0) 28) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 375)))} is VALID [2022-04-08 04:09:18,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {14401#(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; {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:09:18,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {14405#(and (= (+ (- 3) main_~main__i~0) 28) (= (+ (* 2 main_~main__i~0) 373) (+ 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; {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) main_~main__i~0) 28))} is VALID [2022-04-08 04:09:18,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {14409#(and (= (+ (* 2 main_~main__i~0) 371) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= (+ (- 4) 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; {14413#(and (= main_~main__sum~0 528) (= 33 main_~main__i~0))} is VALID [2022-04-08 04:09:18,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {14413#(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; {14417#(and (= 528 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 33))} is VALID [2022-04-08 04:09:18,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {14417#(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; {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:09:18,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {14421#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 525)) (= 33 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14425#(and (= 36 main_~main__i~0) (= (+ main_~main__sum~0 (- 35)) 595))} is VALID [2022-04-08 04:09:18,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {14425#(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; {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-08 04:09:18,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {14429#(and (= 595 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 34))) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} is VALID [2022-04-08 04:09:18,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {14433#(and (= 595 (+ main_~main__sum~0 (- 108))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} is VALID [2022-04-08 04:09:19,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {14437#(and (<= main_~main__i~0 39) (<= 38 main_~main__n~0) (= 595 (+ main_~main__sum~0 (- 146))))} 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; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:09:19,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-08 04:09:19,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-08 04:09:19,003 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-08 04:09:19,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:10:38,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {14260#false} assume !false; {14260#false} is VALID [2022-04-08 04:10:38,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14260#false} is VALID [2022-04-08 04:10:38,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {14454#(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; {14441#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:10:38,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14454#(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-08 04:10:38,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:38,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:38,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:38,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:38,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:39,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {14259#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14458#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:10:40,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {14259#true} assume !!(1 <= ~main__n~0); {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {14259#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; {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {14259#true} call #t~ret5 := main(); {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14259#true} {14259#true} #58#return; {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {14259#true} assume true; {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {14259#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_96~0 := 0; {14259#true} is VALID [2022-04-08 04:10:40,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {14259#true} call ULTIMATE.init(); {14259#true} is VALID [2022-04-08 04:10:40,333 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-08 04:10:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:10:40,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285999091] [2022-04-08 04:10:40,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:10:40,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137913316] [2022-04-08 04:10:40,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137913316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:10:40,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:10:40,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 5] total 44 [2022-04-08 04:10:40,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:10:40,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712882352] [2022-04-08 04:10:40,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712882352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:40,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:40,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-08 04:10:40,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032581997] [2022-04-08 04:10:40,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:10:40,334 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-08 04:10:40,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:10:40,334 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-08 04:10:40,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:40,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-08 04:10:40,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-08 04:10:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 04:10:40,637 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-08 04:11:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:22,082 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 04:11:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 04:11:22,082 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-08 04:11:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:11:22,083 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-08 04:11:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-08 04:11:22,084 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-08 04:11:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2022-04-08 04:11:22,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 54 transitions. [2022-04-08 04:11:22,569 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-08 04:11:22,570 INFO L225 Difference]: With dead ends: 54 [2022-04-08 04:11:22,570 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 04:11:22,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 04:11:22,571 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.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, 22.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:11:22,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 330 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2022-04-08 04:11:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 04:11:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 04:11:22,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:11:22,630 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-08 04:11:22,630 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-08 04:11:22,630 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-08 04:11:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:22,631 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 04:11:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 04:11:22,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:22,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:22,631 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-08 04:11:22,631 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-08 04:11:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:22,636 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-08 04:11:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 04:11:22,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:22,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:22,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:11:22,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:11:22,637 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-08 04:11:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-08 04:11:22,638 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-08 04:11:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:11:22,638 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-08 04:11:22,638 INFO L479 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-08 04:11:22,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-08 04:11:23,288 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-08 04:11:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-08 04:11:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 04:11:23,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:11:23,289 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:11:23,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 04:11:23,489 WARN L460 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-08 04:11:23,490 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:11:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:11:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 67 times [2022-04-08 04:11:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:23,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780860332] [2022-04-08 04:11:23,490 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:11:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1560423295, now seen corresponding path program 68 times [2022-04-08 04:11:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:11:23,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102932276] [2022-04-08 04:11:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:11:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:11:23,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:11:23,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44636491] [2022-04-08 04:11:23,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:11:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:11:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:11:23,513 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-08 04:11:23,515 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-08 04:11:23,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:11:23,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:11:23,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 164 conjunts are in the unsatisfiable core [2022-04-08 04:11:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:11:23,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:11:25,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-08 04:11:25,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#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_96~0 := 0; {14910#true} is VALID [2022-04-08 04:11:25,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-08 04:11:25,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-08 04:11:25,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-08 04:11:25,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#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; {14910#true} is VALID [2022-04-08 04:11:25,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-08 04:11:25,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {14936#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:11:25,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {14936#(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; {14940#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-08 04:11:25,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {14940#(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; {14944#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:11:25,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {14944#(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; {14948#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:11:25,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {14948#(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; {14952#(and (= 5 main_~main__i~0) (= main_~main__sum~0 10))} is VALID [2022-04-08 04:11:25,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {14952#(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; {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:11:25,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {14956#(and (= (+ (- 1) main_~main__i~0) 5) (= 10 (+ 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; {14960#(and (= 7 main_~main__i~0) (= main_~main__sum~0 21))} is VALID [2022-04-08 04:11:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {14960#(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; {14964#(and (= (+ main_~main__sum~0 (- 7)) 21) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:11:25,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {14964#(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; {14968#(and (= main_~main__sum~0 36) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:11:25,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {14968#(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; {14972#(and (= (+ (- 1) main_~main__i~0) 9) (= main_~main__sum~0 (+ 35 main_~main__i~0)))} is VALID [2022-04-08 04:11:25,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {14972#(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; {14976#(and (= 11 main_~main__i~0) (= main_~main__sum~0 55))} is VALID [2022-04-08 04:11:25,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {14976#(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; {14980#(and (= 55 (+ (- 11) main_~main__sum~0)) (= 12 main_~main__i~0))} is VALID [2022-04-08 04:11:25,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {14980#(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; {14984#(and (= (+ main_~main__sum~0 (- 23)) 55) (= 13 main_~main__i~0))} is VALID [2022-04-08 04:11:25,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {14984#(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; {14988#(and (= (+ main_~main__sum~0 (- 36)) 55) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:11:25,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {14988#(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; {14992#(and (= 55 (+ main_~main__sum~0 (- 50))) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:11:25,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {14992#(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; {14996#(and (= 15 (+ (- 105) main_~main__sum~0)) (= (+ main_~main__sum~0 (- 104)) main_~main__i~0))} is VALID [2022-04-08 04:11:25,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {14996#(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; {15000#(and (= main_~main__sum~0 (+ 119 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 16))} is VALID [2022-04-08 04:11:25,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {15000#(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; {15004#(and (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 117)) (= 16 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#(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; {15008#(and (= main_~main__sum~0 171) (= 19 main_~main__i~0))} is VALID [2022-04-08 04:11:25,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {15008#(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; {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} is VALID [2022-04-08 04:11:25,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {15012#(and (= 171 (+ main_~main__sum~0 (- 19))) (= 20 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15016#(and (= 21 main_~main__i~0) (= (+ main_~main__sum~0 (- 39)) 171))} is VALID [2022-04-08 04:11:25,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {15016#(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; {15020#(and (= 21 (+ main_~main__sum~0 (- 210))) (= (+ main_~main__sum~0 (- 209)) main_~main__i~0))} is VALID [2022-04-08 04:11:25,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {15020#(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; {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} is VALID [2022-04-08 04:11:25,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {15024#(and (= (+ (- 1) main_~main__i~0) (+ (- 208) main_~main__sum~0 (* (- 1) main_~main__i~0))) (= 21 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 209))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {15028#(and (= (+ (- 207) main_~main__sum~0 (* (- 2) main_~main__i~0)) 21) (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 206)) (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) main_~main__sum~0 (* (- 3) main_~main__i~0))))} is VALID [2022-04-08 04:11:25,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {15032#(and (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) (- 203)) (+ (- 3) main_~main__i~0)) (= 21 (+ (- 204) 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; {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} is VALID [2022-04-08 04:11:25,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {15036#(and (= (+ (- 199) main_~main__sum~0 (* (- 4) main_~main__i~0)) (+ (- 4) main_~main__i~0)) (= (+ main_~main__sum~0 (* (- 4) main_~main__i~0) (- 200)) 21))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 5) main_~main__i~0))))} is VALID [2022-04-08 04:11:25,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {15040#(and (= 21 (+ main_~main__sum~0 (* (- 5) main_~main__i~0) (- 195))) (= (+ (- 5) main_~main__i~0) (+ main_~main__sum~0 (- 194) (* (- 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; {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 6) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {15044#(and (= 21 (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 189))) (= (+ (* (- 6) main_~main__i~0) main_~main__sum~0 (- 188)) (+ (- 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; {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 7) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {15048#(and (= 21 (+ main_~main__sum~0 (* (- 7) main_~main__i~0) (- 182))) (= (+ main_~main__sum~0 (- 181) (* (- 7) main_~main__i~0)) (+ (- 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; {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 22 (+ main_~main__i~0 (- 8))))} is VALID [2022-04-08 04:11:25,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {15052#(and (= main_~main__sum~0 (+ (* 8 main_~main__i~0) 195)) (= 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; {15056#(and (= 31 main_~main__i~0) (= 435 (+ main_~main__sum~0 (- 30))))} is VALID [2022-04-08 04:11:25,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {15056#(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; {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} is VALID [2022-04-08 04:11:25,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {15060#(and (= (+ (- 465) main_~main__sum~0) 31) (= (+ main_~main__sum~0 (- 464)) main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {15064#(and (= (+ (* 2 main_~main__i~0) 462) main_~main__sum~0) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 3) main_~main__i~0)))} is VALID [2022-04-08 04:11:25,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {15068#(and (= (+ 460 (* 2 main_~main__i~0)) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 31 (+ (- 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; {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 35 main_~main__i~0))} is VALID [2022-04-08 04:11:25,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {15072#(and (= (+ (- 67) main_~main__sum~0) 528) (= 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; {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} is VALID [2022-04-08 04:11:25,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {15076#(and (= (+ (- 594) main_~main__sum~0) main_~main__i~0) (= (+ main_~main__sum~0 (- 595)) 35))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} is VALID [2022-04-08 04:11:25,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {15080#(and (= (+ 629 main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} is VALID [2022-04-08 04:11:25,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {15084#(and (= 666 (+ main_~main__sum~0 (- 37))) (= 38 main_~main__i~0))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 39 main_~main__i~0))} is VALID [2022-04-08 04:11:25,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {15088#(and (= 666 (+ main_~main__sum~0 (- 75))) (= 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; {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 main_~main__n~0))} is VALID [2022-04-08 04:11:25,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {15092#(and (<= main_~main__i~0 40) (= 666 (+ main_~main__sum~0 (- 114))) (<= 39 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; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:11:25,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-08 04:11:25,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-08 04:11:25,581 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-08 04:11:25,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:12:52,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {14911#false} assume !false; {14911#false} is VALID [2022-04-08 04:12:52,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {14911#false} is VALID [2022-04-08 04:12:52,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {15109#(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; {15096#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:12:52,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15109#(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-08 04:12:52,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:52,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {14910#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15113#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-08 04:12:53,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {14910#true} assume !!(1 <= ~main__n~0); {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#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; {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {14910#true} call #t~ret5 := main(); {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14910#true} {14910#true} #58#return; {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {14910#true} assume true; {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {14910#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_96~0 := 0; {14910#true} is VALID [2022-04-08 04:12:53,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {14910#true} call ULTIMATE.init(); {14910#true} is VALID [2022-04-08 04:12:53,650 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-08 04:12:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:12:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102932276] [2022-04-08 04:12:53,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:12:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44636491] [2022-04-08 04:12:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44636491] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:12:53,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:12:53,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 5] total 45 [2022-04-08 04:12:53,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:12:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780860332] [2022-04-08 04:12:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780860332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:12:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:12:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-08 04:12:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729026] [2022-04-08 04:12:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:12:53,651 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:12:53,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:12:53,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:12:53,893 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-08 04:12:53,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-08 04:12:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:12:53,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-08 04:12:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 04:12:53,894 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:13:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:39,740 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-08 04:13:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 04:13:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:13:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:13:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:13:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-08 04:13:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:13:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-08 04:13:39,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2022-04-08 04:13:40,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:13:40,153 INFO L225 Difference]: With dead ends: 55 [2022-04-08 04:13:40,153 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 04:13:40,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 39 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 04:13:40,153 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:13:40,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 338 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 24.1s Time] [2022-04-08 04:13:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 04:13:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 04:13:40,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:13:40,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-08 04:13:40,211 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-08 04:13:40,211 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-08 04:13:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:40,211 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 04:13:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 04:13:40,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:13:40,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:13:40,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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 52 states. [2022-04-08 04:13:40,212 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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 52 states. [2022-04-08 04:13:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:13:40,212 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 04:13:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 04:13:40,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:13:40,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:13:40,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:13:40,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:13:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-08 04:13:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-08 04:13:40,213 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-08 04:13:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:13:40,213 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-08 04:13:40,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-08 04:13:40,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-08 04:13:40,807 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-08 04:13:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 04:13:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 04:13:40,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:13:40,808 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:13:40,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-08 04:13:41,009 WARN L460 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-08 04:13:41,009 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:13:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:13:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1128544342, now seen corresponding path program 69 times [2022-04-08 04:13:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:13:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715918159] [2022-04-08 04:13:41,010 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:13:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1128544342, now seen corresponding path program 70 times [2022-04-08 04:13:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:13:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128125281] [2022-04-08 04:13:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:13:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:13:41,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:13:41,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164496384] [2022-04-08 04:13:41,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:13:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:13:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:13:41,029 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-08 04:13:41,029 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-08 04:13:41,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:13:41,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:13:41,160 WARN L261 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 168 conjunts are in the unsatisfiable core [2022-04-08 04:13:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:13:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:13:42,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {15574#true} call ULTIMATE.init(); {15574#true} is VALID [2022-04-08 04:13:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {15574#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_96~0 := 0; {15574#true} is VALID [2022-04-08 04:13:42,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {15574#true} assume true; {15574#true} is VALID [2022-04-08 04:13:42,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15574#true} {15574#true} #58#return; {15574#true} is VALID [2022-04-08 04:13:42,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {15574#true} call #t~ret5 := main(); {15574#true} is VALID [2022-04-08 04:13:42,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {15574#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; {15574#true} is VALID [2022-04-08 04:13:42,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {15574#true} assume !!(1 <= ~main__n~0); {15574#true} is VALID [2022-04-08 04:13:42,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {15574#true} assume !!(~main__n~0 <= 1000);~main__sum~0 := 0;~main__i~0 := 1; {15600#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-08 04:13:42,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {15600#(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; {15604#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-08 04:13:42,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {15604#(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; {15608#(and (= 3 main_~main__i~0) (= main_~main__sum~0 3))} is VALID [2022-04-08 04:13:42,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {15608#(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; {15612#(and (= 3 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 1) main_~main__i~0) 3))} is VALID [2022-04-08 04:13:42,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#(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; {15616#(and (= (+ main_~main__sum~0 (- 7)) 3) (= 5 main_~main__i~0))} is VALID [2022-04-08 04:13:42,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {15616#(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; {15620#(and (= 6 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 12))))} is VALID [2022-04-08 04:13:42,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {15620#(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; {15624#(and (= 7 main_~main__i~0) (= 3 (+ main_~main__sum~0 (- 18))))} is VALID [2022-04-08 04:13:42,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {15624#(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; {15628#(and (= 3 (+ main_~main__sum~0 (- 25))) (= 8 main_~main__i~0))} is VALID [2022-04-08 04:13:42,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {15628#(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; {15632#(and (= (+ main_~main__sum~0 (- 33)) 3) (= 9 main_~main__i~0))} is VALID [2022-04-08 04:13:42,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {15632#(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; {15636#(and (= 10 main_~main__i~0) (= main_~main__sum~0 45))} is VALID [2022-04-08 04:13:42,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {15636#(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; {15640#(and (= (+ (- 1) main_~main__i~0) 10) (= 45 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:13:42,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {15640#(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; {15644#(and (= 12 main_~main__i~0) (= (+ main_~main__sum~0 (- 21)) 45))} is VALID [2022-04-08 04:13:42,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {15644#(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; {15648#(and (= (+ (- 1) main_~main__i~0) 12) (= (+ 65 main_~main__i~0) main_~main__sum~0))} is VALID [2022-04-08 04:13:42,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {15648#(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; {15652#(and (= (+ (- 13) main_~main__sum~0) 78) (= 14 main_~main__i~0))} is VALID [2022-04-08 04:13:42,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {15652#(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; {15656#(and (= (+ main_~main__sum~0 (- 27)) 78) (= 15 main_~main__i~0))} is VALID [2022-04-08 04:13:42,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {15656#(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; {15660#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} is VALID [2022-04-08 04:13:42,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {15660#(and (= 16 main_~main__i~0) (= (+ main_~main__sum~0 (- 42)) 78))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15664#(and (= 17 main_~main__i~0) (= main_~main__sum~0 136))} is VALID [2022-04-08 04:13:42,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {15664#(and (= 17 main_~main__i~0) (= main_~main__sum~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; {15668#(and (= main_~main__sum~0 (+ 135 main_~main__i~0)) (= (+ (- 1) main_~main__i~0) 17))} is VALID [2022-04-08 04:13:42,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {15668#(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; {15672#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ 134 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-08 04:13:42,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {15672#(and (= (+ (- 2) main_~main__i~0) 17) (= (+ 134 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; {15676#(and (= 20 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 37))))} is VALID [2022-04-08 04:13:42,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {15676#(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; {15680#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} is VALID [2022-04-08 04:13:42,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {15680#(and (= (+ (- 1) main_~main__i~0) 20) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 36))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15684#(and (= 22 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 78))))} is VALID [2022-04-08 04:13:42,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {15684#(and (= 22 main_~main__i~0) (= 153 (+ 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; {15688#(and (= 23 main_~main__i~0) (= 153 (+ main_~main__sum~0 (- 100))))} is VALID [2022-04-08 04:13:42,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {15688#(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; {15692#(and (= (+ (- 1) main_~main__i~0) 23) (= 153 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 99))))} is VALID [2022-04-08 04:13:42,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {15692#(and (= (+ (- 1) main_~main__i~0) 23) (= 153 (+ main_~main__sum~0 (* (- 1) 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; {15696#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 97)) 153) (= 23 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:13:42,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {15696#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 97)) 153) (= 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; {15700#(and (= 23 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 247)))} is VALID [2022-04-08 04:13:42,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {15700#(and (= 23 (+ (- 3) main_~main__i~0)) (= main_~main__sum~0 (+ (* 3 main_~main__i~0) 247)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15704#(and (= (+ (* 3 main_~main__i~0) 244) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 4) main_~main__i~0)))} is VALID [2022-04-08 04:13:42,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {15704#(and (= (+ (* 3 main_~main__i~0) 244) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= 23 (+ (- 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; {15708#(and (= (+ (* 3 main_~main__i~0) 241) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 23 (+ (- 5) main_~main__i~0)))} is VALID [2022-04-08 04:13:42,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {15708#(and (= (+ (* 3 main_~main__i~0) 241) (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3)) (= 23 (+ (- 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; {15712#(and (= (+ (- 6) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 3 main_~main__i~0) 238)))} is VALID [2022-04-08 04:13:42,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {15712#(and (= (+ (- 6) main_~main__i~0) 23) (= (+ main_~main__sum~0 (* (- 3) main_~main__i~0) 6) (+ (* 3 main_~main__i~0) 238)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15716#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} is VALID [2022-04-08 04:13:42,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {15716#(and (= 30 main_~main__i~0) (= 325 (+ main_~main__sum~0 (- 110))))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15720#(and (= 31 main_~main__i~0) (= (+ (- 140) main_~main__sum~0) 325))} is VALID [2022-04-08 04:13:42,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {15720#(and (= 31 main_~main__i~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; {15724#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 139))) (= (+ (- 1) main_~main__i~0) 31))} is VALID [2022-04-08 04:13:42,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {15724#(and (= 325 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) (- 139))) (= (+ (- 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; {15728#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 137)) 325) (= 31 (+ (- 2) main_~main__i~0)))} is VALID [2022-04-08 04:13:42,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {15728#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) (- 137)) 325) (= 31 (+ (- 2) main_~main__i~0)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15732#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 34 main_~main__i~0))} is VALID [2022-04-08 04:13:42,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {15732#(and (= 325 (+ main_~main__sum~0 (- 236))) (= 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; {15736#(and (= main_~main__sum~0 595) (= 35 main_~main__i~0))} is VALID [2022-04-08 04:13:42,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {15736#(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; {15740#(and (= 630 main_~main__sum~0) (= 36 main_~main__i~0))} is VALID [2022-04-08 04:13:42,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {15740#(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; {15744#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 629))) (= (+ (- 630) main_~main__sum~0) 36))} is VALID [2022-04-08 04:13:42,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {15744#(and (= main_~main__i~0 (+ main_~main__sum~0 (- 629))) (= (+ (- 630) main_~main__sum~0) 36))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15748#(and (= (+ (- 2) main_~main__i~0) 36) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 627)))} is VALID [2022-04-08 04:13:42,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {15748#(and (= (+ (- 2) main_~main__i~0) 36) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) 627)))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15752#(and (= (+ (- 38) main_~main__sum~0) 703) (= 39 main_~main__i~0))} is VALID [2022-04-08 04:13:42,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {15752#(and (= (+ (- 38) main_~main__sum~0) 703) (= 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; {15756#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} is VALID [2022-04-08 04:13:42,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {15756#(and (= 40 main_~main__i~0) (= main_~main__sum~0 780))} assume ~main__i~0 <= ~main__n~0;~main__sum~0 := ~main__sum~0 + ~main__i~0;~main__i~0 := 1 + ~main__i~0; {15760#(and (= (+ main_~main__sum~0 (- 40)) 780) (<= 40 main_~main__n~0) (<= main_~main__i~0 41))} is VALID [2022-04-08 04:13:42,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {15760#(and (= (+ main_~main__sum~0 (- 40)) 780) (<= 40 main_~main__n~0) (<= main_~main__i~0 41))} 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; {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-08 04:13:42,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {15764#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {15575#false} is VALID [2022-04-08 04:13:42,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {15575#false} assume !false; {15575#false} is VALID [2022-04-08 04:13:42,712 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-08 04:13:42,712 INFO L328 TraceCheckSpWp]: Computing backward predicates...