/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:39:16,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:39:16,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:39:17,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:39:17,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:39:17,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:39:17,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:39:17,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:39:17,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:39:17,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:39:17,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:39:17,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:39:17,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:39:17,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:39:17,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:39:17,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:39:17,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:39:17,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:39:17,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:39:17,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:39:17,026 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:39:17,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:39:17,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:39:17,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:39:17,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:39:17,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:39:17,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:39:17,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:39:17,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:39:17,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:39:17,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:39:17,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:39:17,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:39:17,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:39:17,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:39:17,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:39:17,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:39:17,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:39:17,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:39:17,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:39:17,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:39:17,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:39:17,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:39:17,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:39:17,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:39:17,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:39:17,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:39:17,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:39:17,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:39:17,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:39:17,044 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:39:17,044 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:39:17,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:39:17,044 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:39:17,044 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:39:17,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:39:17,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:39:17,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:39:17,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:39:17,224 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:39:17,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-28 10:39:17,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94721c9fc/337b46f2c83a41fbab4e08cfd3bdf75f/FLAGdf11c7df4 [2022-04-28 10:39:17,610 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:39:17,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-28 10:39:17,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94721c9fc/337b46f2c83a41fbab4e08cfd3bdf75f/FLAGdf11c7df4 [2022-04-28 10:39:18,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94721c9fc/337b46f2c83a41fbab4e08cfd3bdf75f [2022-04-28 10:39:18,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:39:18,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:39:18,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:39:18,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:39:18,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:39:18,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a1d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18, skipping insertion in model container [2022-04-28 10:39:18,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:39:18,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:39:18,225 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-zilu/benchmark20_conjunctive.i[873,886] [2022-04-28 10:39:18,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:39:18,240 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:39:18,248 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-zilu/benchmark20_conjunctive.i[873,886] [2022-04-28 10:39:18,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:39:18,261 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:39:18,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18 WrapperNode [2022-04-28 10:39:18,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:39:18,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:39:18,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:39:18,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:39:18,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:39:18,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:39:18,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:39:18,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:39:18,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (1/1) ... [2022-04-28 10:39:18,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:39:18,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:18,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:39:18,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:39:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:39:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:39:18,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:39:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:39:18,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:39:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:39:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:39:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:39:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:39:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:39:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:39:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:39:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:39:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:39:18,394 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:39:18,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:39:18,508 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:39:18,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:39:18,513 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:39:18,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:39:18 BoogieIcfgContainer [2022-04-28 10:39:18,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:39:18,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:39:18,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:39:18,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:39:18,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:39:18" (1/3) ... [2022-04-28 10:39:18,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c407c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:39:18, skipping insertion in model container [2022-04-28 10:39:18,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:39:18" (2/3) ... [2022-04-28 10:39:18,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c407c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:39:18, skipping insertion in model container [2022-04-28 10:39:18,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:39:18" (3/3) ... [2022-04-28 10:39:18,519 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.i [2022-04-28 10:39:18,540 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:39:18,540 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:39:18,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:39:18,572 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@944eaa0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@493d3d61 [2022-04-28 10:39:18,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:39:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:39:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:39:18,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:18,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:18,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-28 10:39:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:18,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876512403] [2022-04-28 10:39:18,626 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:39:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-28 10:39:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259741954] [2022-04-28 10:39:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:18,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-28 10:39:18,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:39:18,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 10:39:18,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:18,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-28 10:39:18,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:39:18,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 10:39:18,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-28 10:39:18,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-28 10:39:18,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:18,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:18,878 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:18,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:18,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 10:39:18,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 10:39:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259741954] [2022-04-28 10:39:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259741954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:18,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:39:18,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:18,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876512403] [2022-04-28 10:39:18,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876512403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:18,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:18,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:39:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130101852] [2022-04-28 10:39:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:18,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:39:18,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:18,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:18,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:18,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:39:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:39:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:39:18,939 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,198 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-28 10:39:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:39:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:39:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:39:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:39:19,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 10:39:19,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:19,261 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:39:19,261 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 10:39:19,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:39:19,265 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:19,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 10:39:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 10:39:19,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:19,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,283 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,283 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,285 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:39:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:39:19,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:19,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:19,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 10:39:19,285 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 10:39:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,287 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 10:39:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:39:19,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:19,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:19,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:19,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 10:39:19,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 10:39:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:19,289 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 10:39:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 10:39:19,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:39:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:39:19,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:19,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:19,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:39:19,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-28 10:39:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:19,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417121307] [2022-04-28 10:39:19,317 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:19,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 2 times [2022-04-28 10:39:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902503514] [2022-04-28 10:39:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:19,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-28 10:39:19,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:39:19,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:39:19,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:19,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-28 10:39:19,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:39:19,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:39:19,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:39:19,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-28 10:39:19,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {185#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:19,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,394 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {187#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:19,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {188#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:19,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:39:19,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:39:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902503514] [2022-04-28 10:39:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902503514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690439240] [2022-04-28 10:39:19,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:39:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:19,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:19,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:19,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:39:19,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:39:19,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:19,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:39:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:19,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:19,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-28 10:39:19,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-28 10:39:19,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:39:19,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:39:19,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:39:19,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-28 10:39:19,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {211#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:19,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,609 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:19,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:19,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:39:19,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:39:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:19,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:19,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 10:39:19,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-28 10:39:19,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:19,725 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:19,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:19,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {185#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:19,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-28 10:39:19,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-28 10:39:19,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-28 10:39:19,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 10:39:19,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-28 10:39:19,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-28 10:39:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:19,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690439240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:19,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:19,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:39:19,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:19,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417121307] [2022-04-28 10:39:19,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417121307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:19,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:19,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:39:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382129047] [2022-04-28 10:39:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:39:19,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:19,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:19,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:39:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:39:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:39:19,744 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,851 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:39:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:39:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:39:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 10:39:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 10:39:19,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-28 10:39:19,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:19,872 INFO L225 Difference]: With dead ends: 20 [2022-04-28 10:39:19,872 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:39:19,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:39:19,875 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:19,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:39:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:39:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:39:19,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:19,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,885 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,885 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,887 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:39:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:39:19,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:19,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:19,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:39:19,889 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:39:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:19,892 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:39:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:39:19,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:19,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:19,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:19,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 10:39:19,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 10:39:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:19,896 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 10:39:19,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:19,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 10:39:19,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:39:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:39:19,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:19,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:19,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:20,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:20,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 3 times [2022-04-28 10:39:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552541621] [2022-04-28 10:39:20,128 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:20,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 4 times [2022-04-28 10:39:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:20,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340991510] [2022-04-28 10:39:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:20,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-28 10:39:20,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-28 10:39:20,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-28 10:39:20,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:20,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-28 10:39:20,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-28 10:39:20,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-28 10:39:20,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-28 10:39:20,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-28 10:39:20,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {383#(<= 0 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:20,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {383#(<= 0 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {384#(<= 1 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:20,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#(<= 1 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {385#(<= 1 main_~sum~0)} is VALID [2022-04-28 10:39:20,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(<= 1 main_~sum~0)} assume !(~i~0 < ~n~0); {385#(<= 1 main_~sum~0)} is VALID [2022-04-28 10:39:20,217 INFO L272 TraceCheckUtils]: 10: Hoare triple {385#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {386#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:20,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {387#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:20,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {379#false} is VALID [2022-04-28 10:39:20,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-28 10:39:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340991510] [2022-04-28 10:39:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340991510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871516477] [2022-04-28 10:39:20,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:39:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:20,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:20,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:20,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:39:20,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:39:20,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:20,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:39:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:20,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:20,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2022-04-28 10:39:20,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-28 10:39:20,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-28 10:39:20,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-28 10:39:20,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-28 10:39:20,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-28 10:39:20,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {410#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:20,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {410#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:20,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {385#(<= 1 main_~sum~0)} is VALID [2022-04-28 10:39:20,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(<= 1 main_~sum~0)} assume !(~i~0 < ~n~0); {385#(<= 1 main_~sum~0)} is VALID [2022-04-28 10:39:20,400 INFO L272 TraceCheckUtils]: 10: Hoare triple {385#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:20,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:20,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {379#false} is VALID [2022-04-28 10:39:20,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-28 10:39:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:20,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:20,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-28 10:39:20,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {379#false} is VALID [2022-04-28 10:39:20,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:20,529 INFO L272 TraceCheckUtils]: 10: Hoare triple {444#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:20,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {444#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:20,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {444#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:20,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {451#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:20,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {455#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:20,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-28 10:39:20,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-28 10:39:20,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-28 10:39:20,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-28 10:39:20,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-28 10:39:20,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2022-04-28 10:39:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871516477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:20,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:20,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-28 10:39:20,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:20,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552541621] [2022-04-28 10:39:20,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552541621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:20,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:20,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:39:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908360581] [2022-04-28 10:39:20,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:39:20,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:20,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:20,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:39:20,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:39:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:39:20,543 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:20,682 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:39:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:39:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:39:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 10:39:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 10:39:20,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-28 10:39:20,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:20,698 INFO L225 Difference]: With dead ends: 21 [2022-04-28 10:39:20,698 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:39:20,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:39:20,699 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:20,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:39:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:39:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:39:20,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:20,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,706 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,706 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:20,707 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:39:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:39:20,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:20,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:20,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:39:20,707 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 10:39:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:20,708 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:39:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:39:20,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:20,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:20,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:20,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 10:39:20,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 10:39:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:20,709 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 10:39:20,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:20,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 10:39:20,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:39:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:39:20,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:20,720 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:20,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:39:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 10:39:20,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -955485626, now seen corresponding path program 5 times [2022-04-28 10:39:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:20,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042685665] [2022-04-28 10:39:20,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:20,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -955485626, now seen corresponding path program 6 times [2022-04-28 10:39:20,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:20,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132161880] [2022-04-28 10:39:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:20,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:21,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-28 10:39:21,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 10:39:21,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-28 10:39:21,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:21,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-28 10:39:21,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 10:39:21,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-28 10:39:21,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-28 10:39:21,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-28 10:39:21,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {600#(<= 0 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:21,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= 0 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {601#(<= 2 (+ main_~sum~0 main_~i~0 main_~n~0))} is VALID [2022-04-28 10:39:21,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= 2 (+ main_~sum~0 main_~i~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {602#(<= 2 (+ main_~sum~0 main_~n~0))} is VALID [2022-04-28 10:39:21,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {602#(<= 2 (+ main_~sum~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {603#(<= (+ main_~i~0 1) (+ main_~sum~0 main_~n~0))} is VALID [2022-04-28 10:39:21,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(<= (+ main_~i~0 1) (+ main_~sum~0 main_~n~0))} assume !(~i~0 < ~n~0); {604#(<= 1 main_~sum~0)} is VALID [2022-04-28 10:39:21,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {604#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:21,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {606#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:21,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {596#false} is VALID [2022-04-28 10:39:21,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-28 10:39:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:21,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132161880] [2022-04-28 10:39:21,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132161880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264909286] [2022-04-28 10:39:21,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:39:21,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:21,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:21,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:21,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:39:21,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:39:21,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:21,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:39:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:21,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:21,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2022-04-28 10:39:21,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-28 10:39:21,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 10:39:21,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-28 10:39:21,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-28 10:39:21,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-28 10:39:21,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {629#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:21,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {629#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {633#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:21,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {633#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:21,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {637#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {641#(<= 3 main_~sum~0)} is VALID [2022-04-28 10:39:21,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(<= 3 main_~sum~0)} assume !(~i~0 < ~n~0); {641#(<= 3 main_~sum~0)} is VALID [2022-04-28 10:39:21,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {641#(<= 3 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:21,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:21,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {596#false} is VALID [2022-04-28 10:39:21,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-28 10:39:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:21,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:21,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-28 10:39:21,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {596#false} is VALID [2022-04-28 10:39:21,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:21,569 INFO L272 TraceCheckUtils]: 11: Hoare triple {668#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:21,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {668#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {668#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:21,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {668#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:21,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {675#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:21,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {679#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:21,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {683#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:21,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-28 10:39:21,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-28 10:39:21,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-28 10:39:21,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-28 10:39:21,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-28 10:39:21,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2022-04-28 10:39:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264909286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:21,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-04-28 10:39:21,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:21,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042685665] [2022-04-28 10:39:21,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042685665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:21,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:21,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:39:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167676975] [2022-04-28 10:39:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:39:21,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:21,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:39:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:39:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:39:21,585 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:21,814 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:39:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:39:21,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:39:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-28 10:39:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-28 10:39:21,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-28 10:39:21,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:21,834 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:39:21,835 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:39:21,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:39:21,836 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:21,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:39:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:39:21,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:21,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,844 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,845 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:21,846 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:39:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:39:21,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:21,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:21,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:39:21,847 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:39:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:21,853 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:39:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:39:21,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:21,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:21,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:21,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 10:39:21,854 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 10:39:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:21,854 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 10:39:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:21,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 10:39:21,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:39:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:39:21,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:21,875 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:21,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:22,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:22,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 7 times [2022-04-28 10:39:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573403189] [2022-04-28 10:39:22,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:22,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 8 times [2022-04-28 10:39:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:22,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049874502] [2022-04-28 10:39:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-28 10:39:22,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 10:39:22,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-28 10:39:22,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:22,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-28 10:39:22,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 10:39:22,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-28 10:39:22,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 10:39:22,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-28 10:39:22,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {838#(<= 0 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:39:22,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#(<= 0 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {839#(<= 3 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:22,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(<= 3 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {840#(<= 5 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:22,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(<= 5 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {841#(<= 6 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:22,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {841#(<= 6 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {842#(<= 6 main_~sum~0)} is VALID [2022-04-28 10:39:22,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= 6 main_~sum~0)} assume !(~i~0 < ~n~0); {842#(<= 6 main_~sum~0)} is VALID [2022-04-28 10:39:22,172 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#(<= 6 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {843#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:22,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {844#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:22,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {834#false} is VALID [2022-04-28 10:39:22,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 10:39:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049874502] [2022-04-28 10:39:22,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049874502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151582898] [2022-04-28 10:39:22,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:39:22,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:22,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:22,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:39:22,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:39:22,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:22,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:39:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:22,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:22,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 10:39:22,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-28 10:39:22,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 10:39:22,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-28 10:39:22,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 10:39:22,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-28 10:39:22,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {867#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:22,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {871#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:22,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {875#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:22,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {879#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:39:22,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {842#(<= 6 main_~sum~0)} is VALID [2022-04-28 10:39:22,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= 6 main_~sum~0)} assume !(~i~0 < ~n~0); {842#(<= 6 main_~sum~0)} is VALID [2022-04-28 10:39:22,400 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#(<= 6 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:22,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:22,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 10:39:22,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 10:39:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:22,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:22,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 10:39:22,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 10:39:22,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:22,847 INFO L272 TraceCheckUtils]: 12: Hoare triple {909#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:22,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {909#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:22,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {916#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:22,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {916#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:22,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {920#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:22,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {924#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:22,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {928#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:22,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-28 10:39:22,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 10:39:22,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-28 10:39:22,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 10:39:22,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-28 10:39:22,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 10:39:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:22,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151582898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:22,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:22,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-28 10:39:22,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:22,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573403189] [2022-04-28 10:39:22,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573403189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:22,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:22,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:39:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500329721] [2022-04-28 10:39:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:39:22,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:22,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:22,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:22,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:39:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:22,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:39:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:39:22,866 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:23,079 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:39:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:39:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:39:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-28 10:39:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-28 10:39:23,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-04-28 10:39:23,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:23,108 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:39:23,108 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:39:23,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:39:23,109 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:23,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:39:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:39:23,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:23,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,122 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,122 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:23,123 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:39:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:39:23,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:23,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:23,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:39:23,124 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:39:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:23,124 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:39:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:39:23,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:23,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:23,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:23,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 10:39:23,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 10:39:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:23,125 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 10:39:23,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:23,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 10:39:23,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:39:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:39:23,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:23,138 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:23,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:23,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:23,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2033757318, now seen corresponding path program 9 times [2022-04-28 10:39:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338785437] [2022-04-28 10:39:23,346 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:23,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2033757318, now seen corresponding path program 10 times [2022-04-28 10:39:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:23,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285465109] [2022-04-28 10:39:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:23,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-28 10:39:23,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-28 10:39:23,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-28 10:39:23,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:23,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-28 10:39:23,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-28 10:39:23,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-28 10:39:23,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-28 10:39:23,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-28 10:39:23,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1089#(<= 0 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:23,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1089#(<= 0 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1090#(<= 4 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:39:23,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1090#(<= 4 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1091#(<= 7 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:23,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#(<= 7 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= 9 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:23,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 9 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#(<= 10 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:23,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {1093#(<= 10 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1094#(<= 10 main_~sum~0)} is VALID [2022-04-28 10:39:23,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(<= 10 main_~sum~0)} assume !(~i~0 < ~n~0); {1094#(<= 10 main_~sum~0)} is VALID [2022-04-28 10:39:23,448 INFO L272 TraceCheckUtils]: 13: Hoare triple {1094#(<= 10 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1095#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:23,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1095#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1096#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:23,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {1096#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1085#false} is VALID [2022-04-28 10:39:23,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-28 10:39:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285465109] [2022-04-28 10:39:23,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285465109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:23,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841216168] [2022-04-28 10:39:23,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:39:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:23,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:23,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:39:23,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:39:23,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:23,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:39:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:23,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:23,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1084#true} is VALID [2022-04-28 10:39:23,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-28 10:39:23,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-28 10:39:23,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-28 10:39:23,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-28 10:39:23,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-28 10:39:23,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1119#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:23,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1123#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:23,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1127#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:23,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1131#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:39:23,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {1131#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1135#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:39:23,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1094#(<= 10 main_~sum~0)} is VALID [2022-04-28 10:39:23,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(<= 10 main_~sum~0)} assume !(~i~0 < ~n~0); {1094#(<= 10 main_~sum~0)} is VALID [2022-04-28 10:39:23,721 INFO L272 TraceCheckUtils]: 13: Hoare triple {1094#(<= 10 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:23,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:23,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1085#false} is VALID [2022-04-28 10:39:23,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-28 10:39:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:23,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:24,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-28 10:39:24,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1085#false} is VALID [2022-04-28 10:39:24,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:24,570 INFO L272 TraceCheckUtils]: 13: Hoare triple {1165#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:24,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1165#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:24,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1165#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:24,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {1176#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1172#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:24,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1176#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:24,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1184#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1180#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:24,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1184#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:24,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1188#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:24,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1084#true} is VALID [2022-04-28 10:39:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:24,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841216168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:24,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:24,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 10:39:24,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338785437] [2022-04-28 10:39:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338785437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:24,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:24,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:39:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463963655] [2022-04-28 10:39:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:39:24,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:24,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:24,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:39:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:39:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:39:24,604 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:24,891 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:39:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:39:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:39:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-28 10:39:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-28 10:39:24,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 24 transitions. [2022-04-28 10:39:24,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:24,911 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:39:24,911 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:39:24,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:39:24,912 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:24,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:39:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:39:24,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:24,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,927 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,927 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:24,928 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:39:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:39:24,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:24,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:24,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:39:24,928 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:39:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:24,929 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:39:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:39:24,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:24,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:24,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:24,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 10:39:24,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 10:39:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:24,930 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 10:39:24,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:24,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 10:39:24,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:39:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:39:24,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:24,947 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:24,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:39:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:25,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1342643752, now seen corresponding path program 11 times [2022-04-28 10:39:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:25,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798500183] [2022-04-28 10:39:25,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:25,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1342643752, now seen corresponding path program 12 times [2022-04-28 10:39:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:25,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984652807] [2022-04-28 10:39:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:25,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-28 10:39:25,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-28 10:39:25,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-28 10:39:25,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:25,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-28 10:39:25,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-28 10:39:25,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-28 10:39:25,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-28 10:39:25,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-28 10:39:25,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1357#(<= 0 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:39:25,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1357#(<= 0 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1358#(<= 5 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:25,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1358#(<= 5 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1359#(<= 9 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:39:25,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1359#(<= 9 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1360#(<= 12 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:25,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1360#(<= 12 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1361#(<= 14 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:25,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {1361#(<= 14 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1362#(<= 15 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:25,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1362#(<= 15 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1363#(<= 15 main_~sum~0)} is VALID [2022-04-28 10:39:25,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(<= 15 main_~sum~0)} assume !(~i~0 < ~n~0); {1363#(<= 15 main_~sum~0)} is VALID [2022-04-28 10:39:25,289 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#(<= 15 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1364#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:25,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1364#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1365#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:25,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {1365#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1353#false} is VALID [2022-04-28 10:39:25,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-28 10:39:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984652807] [2022-04-28 10:39:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984652807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362792492] [2022-04-28 10:39:25,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:39:25,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:25,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:25,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:39:25,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:39:25,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:25,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:39:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:25,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:25,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-28 10:39:25,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-28 10:39:25,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-28 10:39:25,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-28 10:39:25,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-28 10:39:25,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-28 10:39:25,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1388#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:25,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1392#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:25,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1392#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1396#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:25,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1396#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1400#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:39:25,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1404#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:39:25,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1408#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:39:25,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {1408#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1363#(<= 15 main_~sum~0)} is VALID [2022-04-28 10:39:25,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(<= 15 main_~sum~0)} assume !(~i~0 < ~n~0); {1363#(<= 15 main_~sum~0)} is VALID [2022-04-28 10:39:25,627 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#(<= 15 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:25,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:25,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {1422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1353#false} is VALID [2022-04-28 10:39:25,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-28 10:39:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:25,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:40,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-28 10:39:40,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {1422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1353#false} is VALID [2022-04-28 10:39:40,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:40,280 INFO L272 TraceCheckUtils]: 14: Hoare triple {1438#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:40,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1438#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:40,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1445#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1438#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:40,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1445#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:40,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {1453#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1449#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:40,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {1457#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1453#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:40,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1461#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1457#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:40,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1461#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:40,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1465#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:39:40,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-28 10:39:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:40,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362792492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:40,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:40,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-04-28 10:39:40,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:40,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798500183] [2022-04-28 10:39:40,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798500183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:40,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:40,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:39:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240450788] [2022-04-28 10:39:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:39:40,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:40,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:39:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:40,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:39:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:39:40,305 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:40,638 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:39:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:39:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 10:39:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-28 10:39:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-28 10:39:40,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2022-04-28 10:39:40,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:40,659 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:39:40,659 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:39:40,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:39:40,661 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:40,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:39:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 10:39:40,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:40,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,683 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,684 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:40,686 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:39:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:39:40,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:40,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:40,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:39:40,686 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:39:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:40,687 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:39:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:39:40,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:40,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:40,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:40,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 10:39:40,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 10:39:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:40,688 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 10:39:40,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:40,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 10:39:40,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:39:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:39:40,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:40,705 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:40,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:40,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1363105478, now seen corresponding path program 13 times [2022-04-28 10:39:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:40,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634701624] [2022-04-28 10:39:40,919 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:40,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1363105478, now seen corresponding path program 14 times [2022-04-28 10:39:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:40,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601091410] [2022-04-28 10:39:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:41,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:41,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-28 10:39:41,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-28 10:39:41,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:41,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-28 10:39:41,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1642#(<= 0 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:41,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(<= 0 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1643#(<= 6 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:39:41,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {1643#(<= 6 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1644#(<= 11 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:41,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {1644#(<= 11 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1645#(<= 15 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:39:41,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(<= 15 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1646#(<= 18 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:41,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1646#(<= 18 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1647#(<= 20 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:41,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1647#(<= 20 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1648#(<= 21 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:41,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1648#(<= 21 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1649#(<= 21 main_~sum~0)} is VALID [2022-04-28 10:39:41,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {1649#(<= 21 main_~sum~0)} assume !(~i~0 < ~n~0); {1649#(<= 21 main_~sum~0)} is VALID [2022-04-28 10:39:41,038 INFO L272 TraceCheckUtils]: 15: Hoare triple {1649#(<= 21 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:41,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {1650#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1651#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:41,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {1651#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1638#false} is VALID [2022-04-28 10:39:41,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-28 10:39:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:41,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601091410] [2022-04-28 10:39:41,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601091410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:41,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157524356] [2022-04-28 10:39:41,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:39:41,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:41,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:41,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:39:41,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:39:41,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:41,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:39:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:41,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:41,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1637#true} is VALID [2022-04-28 10:39:41,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-28 10:39:41,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-28 10:39:41,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-28 10:39:41,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-28 10:39:41,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-28 10:39:41,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1674#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:41,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1678#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:41,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1678#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1682#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:41,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1682#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1686#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:39:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1690#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:39:41,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1690#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1694#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:39:41,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1698#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:39:41,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {1698#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1649#(<= 21 main_~sum~0)} is VALID [2022-04-28 10:39:41,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1649#(<= 21 main_~sum~0)} assume !(~i~0 < ~n~0); {1649#(<= 21 main_~sum~0)} is VALID [2022-04-28 10:39:41,439 INFO L272 TraceCheckUtils]: 15: Hoare triple {1649#(<= 21 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:41,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:41,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1638#false} is VALID [2022-04-28 10:39:41,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-28 10:39:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:41,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:39:53,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-28 10:39:53,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1638#false} is VALID [2022-04-28 10:39:53,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:53,266 INFO L272 TraceCheckUtils]: 15: Hoare triple {1728#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:53,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1728#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:53,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {1735#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:39:53,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1739#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1735#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:53,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1743#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1739#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:39:53,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {1747#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1743#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:53,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1747#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:53,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1755#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1751#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:39:53,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {1759#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1755#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:39:53,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1759#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:39:53,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-28 10:39:53,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-28 10:39:53,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-28 10:39:53,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-28 10:39:53,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-28 10:39:53,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1637#true} is VALID [2022-04-28 10:39:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:53,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157524356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:39:53,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:39:53,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 30 [2022-04-28 10:39:53,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:39:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634701624] [2022-04-28 10:39:53,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634701624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:39:53,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:39:53,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:39:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829472486] [2022-04-28 10:39:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:39:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:39:53,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:39:53,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:53,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:39:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:39:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:39:53,292 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:53,667 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:39:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:39:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:39:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:39:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-28 10:39:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-28 10:39:53,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-28 10:39:53,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:53,693 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:39:53,693 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:39:53,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:39:53,694 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:39:53,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:39:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:39:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 10:39:53,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:39:53,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,715 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,716 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:53,717 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:39:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:39:53,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:53,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:53,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:39:53,720 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:39:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:39:53,722 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:39:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:39:53,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:39:53,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:39:53,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:39:53,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:39:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 10:39:53,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 10:39:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:39:53,723 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 10:39:53,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:39:53,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 10:39:53,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:39:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:39:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:39:53,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:39:53,741 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:39:53,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:39:53,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:53,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:39:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:39:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -658014312, now seen corresponding path program 15 times [2022-04-28 10:39:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:39:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [31243706] [2022-04-28 10:39:53,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:39:53,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:39:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -658014312, now seen corresponding path program 16 times [2022-04-28 10:39:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:39:53,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443299574] [2022-04-28 10:39:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:39:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:39:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:39:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:54,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-28 10:39:54,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-28 10:39:54,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-28 10:39:54,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:39:54,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-28 10:39:54,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-28 10:39:54,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-28 10:39:54,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-28 10:39:54,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-28 10:39:54,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1944#(<= 0 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:39:54,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= 0 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1945#(<= 7 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:54,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(<= 7 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1946#(<= 13 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:39:54,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1946#(<= 13 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1947#(<= 18 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:39:54,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {1947#(<= 18 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1948#(<= 22 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:39:54,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#(<= 22 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1949#(<= 25 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:39:54,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(<= 25 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1950#(<= 27 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:39:54,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {1950#(<= 27 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1951#(<= 28 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:39:54,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1951#(<= 28 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1952#(<= 28 main_~sum~0)} is VALID [2022-04-28 10:39:54,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#(<= 28 main_~sum~0)} assume !(~i~0 < ~n~0); {1952#(<= 28 main_~sum~0)} is VALID [2022-04-28 10:39:54,074 INFO L272 TraceCheckUtils]: 16: Hoare triple {1952#(<= 28 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1953#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:39:54,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {1953#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1954#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:39:54,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {1954#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1940#false} is VALID [2022-04-28 10:39:54,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-28 10:39:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:39:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443299574] [2022-04-28 10:39:54,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443299574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:39:54,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951034823] [2022-04-28 10:39:54,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:39:54,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:39:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:39:54,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:39:54,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:39:54,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:39:54,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:39:54,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:39:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:39:54,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:39:54,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-28 10:39:54,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-28 10:39:54,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-28 10:39:54,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-28 10:39:54,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-28 10:39:54,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-28 10:39:54,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1977#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:39:54,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {1977#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1981#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:39:54,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1981#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1985#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:39:54,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1985#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1989#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:39:54,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1993#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:39:54,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1993#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1997#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:39:54,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2001#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:39:54,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2001#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2005#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:39:54,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1952#(<= 28 main_~sum~0)} is VALID [2022-04-28 10:39:54,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#(<= 28 main_~sum~0)} assume !(~i~0 < ~n~0); {1952#(<= 28 main_~sum~0)} is VALID [2022-04-28 10:39:54,508 INFO L272 TraceCheckUtils]: 16: Hoare triple {1952#(<= 28 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:39:54,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:39:54,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1940#false} is VALID [2022-04-28 10:39:54,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-28 10:39:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:39:54,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:04,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-28 10:40:04,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1940#false} is VALID [2022-04-28 10:40:04,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:04,892 INFO L272 TraceCheckUtils]: 16: Hoare triple {2035#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:04,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {2035#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:04,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2035#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:04,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2046#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2042#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:04,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {2050#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2046#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:40:04,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2054#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2050#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:04,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {2058#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:04,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2058#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:04,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {2066#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2062#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:40:05,256 WARN L290 TraceCheckUtils]: 7: Hoare triple {2070#(forall ((aux_div_v_main_~sum~0_95_49 Int) (aux_div_v_main_~i~0_86_68 Int)) (or (<= (* 3 aux_div_v_main_~i~0_86_68) (+ 5 aux_div_v_main_~sum~0_95_49)) (<= (+ aux_div_v_main_~sum~0_95_49 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_86_68))) (<= aux_div_v_main_~i~0_86_68 (+ main_~i~0 6)) (<= (+ 1 (* 2 aux_div_v_main_~i~0_86_68)) (+ main_~sum~0 (* 3 aux_div_v_main_~sum~0_95_49) main_~i~0)) (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~sum~0_95_49)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2066#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is UNKNOWN [2022-04-28 10:40:05,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2070#(forall ((aux_div_v_main_~sum~0_95_49 Int) (aux_div_v_main_~i~0_86_68 Int)) (or (<= (* 3 aux_div_v_main_~i~0_86_68) (+ 5 aux_div_v_main_~sum~0_95_49)) (<= (+ aux_div_v_main_~sum~0_95_49 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_86_68))) (<= aux_div_v_main_~i~0_86_68 (+ main_~i~0 6)) (<= (+ 1 (* 2 aux_div_v_main_~i~0_86_68)) (+ main_~sum~0 (* 3 aux_div_v_main_~sum~0_95_49) main_~i~0)) (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~sum~0_95_49)))))} is VALID [2022-04-28 10:40:05,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-28 10:40:05,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-28 10:40:05,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-28 10:40:05,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-28 10:40:05,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-28 10:40:05,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-28 10:40:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:05,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951034823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:05,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:05,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-04-28 10:40:05,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:05,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [31243706] [2022-04-28 10:40:05,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [31243706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:05,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:05,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:40:05,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528828141] [2022-04-28 10:40:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:40:05,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:05,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:40:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:40:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:40:05,272 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:05,715 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:40:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:40:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:40:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-04-28 10:40:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-04-28 10:40:05,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 27 transitions. [2022-04-28 10:40:05,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:05,736 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:40:05,736 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:40:05,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:40:05,737 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:05,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:40:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:40:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:40:05,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:05,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,759 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,759 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:05,760 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:40:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:40:05,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:05,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:05,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:40:05,761 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:40:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:05,761 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:40:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:40:05,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:05,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:05,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 10:40:05,762 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 10:40:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:05,763 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 10:40:05,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:05,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 10:40:05,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:40:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:40:05,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:05,782 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:05,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 10:40:05,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1111781638, now seen corresponding path program 17 times [2022-04-28 10:40:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211245402] [2022-04-28 10:40:05,994 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:05,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1111781638, now seen corresponding path program 18 times [2022-04-28 10:40:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:05,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73393637] [2022-04-28 10:40:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:05,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:06,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-28 10:40:06,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-28 10:40:06,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:06,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-28 10:40:06,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2263#(<= 0 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:40:06,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#(<= 0 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2264#(<= 8 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:40:06,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(<= 8 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2265#(<= 15 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:06,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#(<= 15 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2266#(<= 21 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:40:06,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {2266#(<= 21 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2267#(<= 26 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:06,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {2267#(<= 26 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2268#(<= 30 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:40:06,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {2268#(<= 30 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2269#(<= 33 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:40:06,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= 33 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(<= 35 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:06,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= 35 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2271#(<= 36 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:06,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= 36 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2272#(<= 36 main_~sum~0)} is VALID [2022-04-28 10:40:06,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {2272#(<= 36 main_~sum~0)} assume !(~i~0 < ~n~0); {2272#(<= 36 main_~sum~0)} is VALID [2022-04-28 10:40:06,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {2272#(<= 36 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:06,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {2273#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2274#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:06,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {2274#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2259#false} is VALID [2022-04-28 10:40:06,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-28 10:40:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73393637] [2022-04-28 10:40:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73393637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917337519] [2022-04-28 10:40:06,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:40:06,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:06,165 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:06,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:40:06,197 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:40:06,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:06,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:40:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:06,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:06,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-28 10:40:06,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-28 10:40:06,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-28 10:40:06,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-28 10:40:06,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-28 10:40:06,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-28 10:40:06,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2297#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:06,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2301#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:40:06,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {2301#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2305#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:40:06,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2309#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:40:06,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {2309#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2313#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:40:06,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {2313#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2317#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:40:06,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {2317#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2321#(and (< 5 main_~n~0) (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:40:06,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(and (< 5 main_~n~0) (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2325#(and (< 5 main_~n~0) (<= 21 main_~sum~0))} is VALID [2022-04-28 10:40:06,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(and (< 5 main_~n~0) (<= 21 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2329#(and (< 5 main_~n~0) (<= (+ main_~i~0 20) main_~sum~0))} is VALID [2022-04-28 10:40:06,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (< 5 main_~n~0) (<= (+ main_~i~0 20) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2333#(and (< 5 main_~n~0) (<= (+ 18 (* main_~i~0 2)) main_~sum~0))} is VALID [2022-04-28 10:40:06,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {2333#(and (< 5 main_~n~0) (<= (+ 18 (* main_~i~0 2)) main_~sum~0))} assume !(~i~0 < ~n~0); {2337#(< 5 (div (+ main_~sum~0 (- 18)) 2))} is VALID [2022-04-28 10:40:06,827 INFO L272 TraceCheckUtils]: 17: Hoare triple {2337#(< 5 (div (+ main_~sum~0 (- 18)) 2))} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:06,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:06,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {2345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-28 10:40:06,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-28 10:40:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:06,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:09,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-28 10:40:09,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {2345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-28 10:40:09,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:09,064 INFO L272 TraceCheckUtils]: 17: Hoare triple {2361#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:09,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {2365#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} assume !(~i~0 < ~n~0); {2361#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:09,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {2369#(or (<= 0 (+ main_~sum~0 main_~i~0)) (< (+ main_~i~0 1) main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2365#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:09,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {2373#(<= 3 (+ main_~sum~0 (* main_~n~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2369#(or (<= 0 (+ main_~sum~0 main_~i~0)) (< (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-28 10:40:09,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {2377#(<= 3 (+ main_~sum~0 main_~i~0 (* main_~n~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2373#(<= 3 (+ main_~sum~0 (* main_~n~0 2)))} is VALID [2022-04-28 10:40:09,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {2381#(<= (div (+ (- 2) main_~sum~0) (- 2)) (+ (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2377#(<= 3 (+ main_~sum~0 main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-28 10:40:09,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {2385#(<= (div (+ 2 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 4)) (- 2)))) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2381#(<= (div (+ (- 2) main_~sum~0) (- 2)) (+ (* main_~i~0 2) 1))} is VALID [2022-04-28 10:40:09,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= (div (+ (- 1) (div (+ (- 1) main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2385#(<= (div (+ 2 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 4)) (- 2)))) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:09,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {2393#(<= (div (+ main_~i~0 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 5)) (- 2)))) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2389#(<= (div (+ (- 1) (div (+ (- 1) main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:40:09,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {2397#(forall ((aux_mod_aux_div_v_main_~sum~0_114_55_70 Int) (aux_div_aux_div_v_main_~sum~0_114_55_70 Int) (v_main_~i~0_104 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_114_55_70 (+ 5 v_main_~i~0_104)) (> 0 aux_mod_aux_div_v_main_~sum~0_114_55_70) (not (<= (+ main_~i~0 1) v_main_~i~0_104)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_114_55_70 2) 7) (+ (* aux_div_aux_div_v_main_~sum~0_114_55_70 4) main_~sum~0 (* 3 v_main_~i~0_104) main_~i~0)) (>= aux_mod_aux_div_v_main_~sum~0_114_55_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2393#(<= (div (+ main_~i~0 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 5)) (- 2)))) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:40:09,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {2401#(forall ((aux_mod_aux_div_v_main_~sum~0_114_55_70 Int) (aux_div_aux_div_v_main_~sum~0_114_55_70 Int) (v_main_~i~0_104 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_114_55_70 (+ 5 v_main_~i~0_104)) (> 0 aux_mod_aux_div_v_main_~sum~0_114_55_70) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_114_55_70 2) 6) (+ (* aux_div_aux_div_v_main_~sum~0_114_55_70 4) main_~sum~0 (* 3 v_main_~i~0_104) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_114_55_70 2) (< v_main_~i~0_104 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2397#(forall ((aux_mod_aux_div_v_main_~sum~0_114_55_70 Int) (aux_div_aux_div_v_main_~sum~0_114_55_70 Int) (v_main_~i~0_104 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_114_55_70 (+ 5 v_main_~i~0_104)) (> 0 aux_mod_aux_div_v_main_~sum~0_114_55_70) (not (<= (+ main_~i~0 1) v_main_~i~0_104)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_114_55_70 2) 7) (+ (* aux_div_aux_div_v_main_~sum~0_114_55_70 4) main_~sum~0 (* 3 v_main_~i~0_104) main_~i~0)) (>= aux_mod_aux_div_v_main_~sum~0_114_55_70 2)))} is VALID [2022-04-28 10:40:09,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2401#(forall ((aux_mod_aux_div_v_main_~sum~0_114_55_70 Int) (aux_div_aux_div_v_main_~sum~0_114_55_70 Int) (v_main_~i~0_104 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_114_55_70 (+ 5 v_main_~i~0_104)) (> 0 aux_mod_aux_div_v_main_~sum~0_114_55_70) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_114_55_70 2) 6) (+ (* aux_div_aux_div_v_main_~sum~0_114_55_70 4) main_~sum~0 (* 3 v_main_~i~0_104) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_114_55_70 2) (< v_main_~i~0_104 (+ main_~i~0 2))))} is VALID [2022-04-28 10:40:09,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-28 10:40:09,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-28 10:40:09,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-28 10:40:09,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-28 10:40:09,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-28 10:40:09,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-28 10:40:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:09,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917337519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:09,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:09,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-04-28 10:40:09,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211245402] [2022-04-28 10:40:09,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211245402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:09,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:09,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:40:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713724125] [2022-04-28 10:40:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:40:09,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:09,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:09,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:40:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:09,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:40:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:40:09,090 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:09,638 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:40:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:40:09,638 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:40:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2022-04-28 10:40:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2022-04-28 10:40:09,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 28 transitions. [2022-04-28 10:40:09,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:09,660 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:40:09,660 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:40:09,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:40:09,662 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:09,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:40:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:40:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:40:09,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:09,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,686 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,686 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:09,687 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:40:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:40:09,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:09,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:09,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:40:09,687 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 10:40:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:09,688 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 10:40:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:40:09,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:09,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:09,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:09,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 10:40:09,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 10:40:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:09,689 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 10:40:09,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:09,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 10:40:09,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 10:40:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:40:09,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:09,716 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:09,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:09,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:40:09,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash 140881240, now seen corresponding path program 19 times [2022-04-28 10:40:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:09,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015019602] [2022-04-28 10:40:09,919 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:09,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash 140881240, now seen corresponding path program 20 times [2022-04-28 10:40:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290366675] [2022-04-28 10:40:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:10,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-28 10:40:10,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-28 10:40:10,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-28 10:40:10,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:10,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-28 10:40:10,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-28 10:40:10,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-28 10:40:10,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-28 10:40:10,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-28 10:40:10,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2602#(<= 0 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:40:10,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2602#(<= 0 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2603#(<= 9 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:40:10,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#(<= 9 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2604#(<= 17 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:40:10,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {2604#(<= 17 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2605#(<= 24 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:10,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {2605#(<= 24 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2606#(<= 30 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:40:10,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {2606#(<= 30 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2607#(<= 35 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:10,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {2607#(<= 35 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2608#(<= 39 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:40:10,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(<= 39 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2609#(<= 42 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:40:10,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(<= 42 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2610#(<= 44 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:10,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= 44 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2611#(<= 45 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:10,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {2611#(<= 45 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2612#(<= 45 main_~sum~0)} is VALID [2022-04-28 10:40:10,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {2612#(<= 45 main_~sum~0)} assume !(~i~0 < ~n~0); {2612#(<= 45 main_~sum~0)} is VALID [2022-04-28 10:40:10,096 INFO L272 TraceCheckUtils]: 18: Hoare triple {2612#(<= 45 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:10,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {2613#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2614#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:10,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2598#false} is VALID [2022-04-28 10:40:10,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-28 10:40:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290366675] [2022-04-28 10:40:10,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290366675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77274668] [2022-04-28 10:40:10,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:40:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:10,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:10,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:40:10,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:10,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:40:10,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:40:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:10,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:10,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-28 10:40:10,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2637#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:10,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {2637#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2641#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:40:10,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {2641#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2645#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:40:10,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {2645#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2649#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:40:10,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {2649#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:40:10,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {2653#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2657#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:40:10,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {2657#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2661#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:40:10,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {2661#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2665#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:40:10,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {2665#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2669#(and (< 7 main_~n~0) (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:40:10,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {2669#(and (< 7 main_~n~0) (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2673#(and (< 7 main_~n~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:40:10,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {2673#(and (< 7 main_~n~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2677#(and (< 7 main_~n~0) (<= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:10,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {2677#(and (< 7 main_~n~0) (<= (+ 35 main_~i~0) main_~sum~0))} assume !(~i~0 < ~n~0); {2681#(< 42 main_~sum~0)} is VALID [2022-04-28 10:40:10,660 INFO L272 TraceCheckUtils]: 18: Hoare triple {2681#(< 42 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:10,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:10,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {2689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2598#false} is VALID [2022-04-28 10:40:10,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-28 10:40:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:13,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-28 10:40:13,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {2689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2598#false} is VALID [2022-04-28 10:40:13,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:13,229 INFO L272 TraceCheckUtils]: 18: Hoare triple {2705#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:13,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {2709#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} assume !(~i~0 < ~n~0); {2705#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:13,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 1 (+ main_~sum~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2709#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:13,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {2717#(<= 1 (+ main_~sum~0 main_~i~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2713#(<= 1 (+ main_~sum~0 main_~n~0))} is VALID [2022-04-28 10:40:13,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {2721#(<= 0 (+ main_~sum~0 (* main_~i~0 3) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2717#(<= 1 (+ main_~sum~0 main_~i~0 main_~n~0))} is VALID [2022-04-28 10:40:13,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {2725#(<= (div (+ main_~sum~0 main_~i~0 1) (- 3)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2721#(<= 0 (+ main_~sum~0 (* main_~i~0 3) 1))} is VALID [2022-04-28 10:40:13,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {2729#(<= (div (+ (- 1) main_~sum~0 (* main_~i~0 2)) (- 3)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2725#(<= (div (+ main_~sum~0 main_~i~0 1) (- 3)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:13,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {2733#(forall ((v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (<= 4 (+ (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (not (<= (+ main_~i~0 1) v_main_~i~0_122))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2729#(<= (div (+ (- 1) main_~sum~0 (* main_~i~0 2)) (- 3)) (+ main_~i~0 3))} is VALID [2022-04-28 10:40:13,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {2737#(forall ((v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (<= 3 (+ (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_122 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2733#(forall ((v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (<= 4 (+ (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (not (<= (+ main_~i~0 1) v_main_~i~0_122))))} is VALID [2022-04-28 10:40:13,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2741#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (<= 3 (+ (* 2 v_main_~i~0_124) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (not (<= (+ main_~i~0 1) v_main_~i~0_124))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2737#(forall ((v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (<= 3 (+ (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_122 (+ main_~i~0 2))))} is VALID [2022-04-28 10:40:13,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= 2 (+ (* 2 v_main_~i~0_124) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_124 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2741#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (<= 3 (+ (* 2 v_main_~i~0_124) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (not (<= (+ main_~i~0 1) v_main_~i~0_124))))} is VALID [2022-04-28 10:40:13,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {2749#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int) (v_main_~i~0_126 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= 2 (+ (* 2 v_main_~i~0_124) (* 2 v_main_~i~0_126) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_124 (+ 2 v_main_~i~0_126)) (not (<= (+ main_~i~0 1) v_main_~i~0_126))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2745#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= 2 (+ (* 2 v_main_~i~0_124) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_124 (+ main_~i~0 2))))} is VALID [2022-04-28 10:40:13,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2749#(forall ((v_main_~i~0_124 Int) (v_main_~i~0_122 Int) (aux_div_v_main_~sum~0_133_61 Int) (v_main_~i~0_126 Int)) (or (< v_main_~i~0_122 (+ 2 v_main_~i~0_124)) (<= 2 (+ (* 2 v_main_~i~0_124) (* 2 v_main_~i~0_126) (* aux_div_v_main_~sum~0_133_61 3) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_122))) (<= aux_div_v_main_~sum~0_133_61 (+ 3 v_main_~i~0_122)) (< v_main_~i~0_124 (+ 2 v_main_~i~0_126)) (not (<= (+ main_~i~0 1) v_main_~i~0_126))))} is VALID [2022-04-28 10:40:13,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-28 10:40:13,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-28 10:40:13,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-28 10:40:13,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-28 10:40:13,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-28 10:40:13,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2597#true} is VALID [2022-04-28 10:40:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:13,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77274668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:13,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:13,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-28 10:40:13,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:13,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015019602] [2022-04-28 10:40:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015019602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:13,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:40:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209409053] [2022-04-28 10:40:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:40:13,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:13,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:13,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:40:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:40:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:40:13,268 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:13,863 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:40:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:40:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:40:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2022-04-28 10:40:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2022-04-28 10:40:13,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 29 transitions. [2022-04-28 10:40:13,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:13,897 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:40:13,897 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:40:13,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=2631, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:40:13,898 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:13,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:40:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:40:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:40:13,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:13,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,930 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,930 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:13,930 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:40:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:40:13,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:13,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:13,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:40:13,931 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 10:40:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:13,931 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:40:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:40:13,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:13,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:13,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 10:40:13,932 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 10:40:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:13,932 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 10:40:13,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:13,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 10:40:13,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 10:40:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:40:13,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:13,956 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:13,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:14,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 10:40:14,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 107739974, now seen corresponding path program 21 times [2022-04-28 10:40:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:14,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128219048] [2022-04-28 10:40:14,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:14,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 107739974, now seen corresponding path program 22 times [2022-04-28 10:40:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017386302] [2022-04-28 10:40:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:14,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-28 10:40:14,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-28 10:40:14,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:14,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-28 10:40:14,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2958#(<= 0 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:40:14,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= 0 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2959#(<= 10 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:40:14,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {2959#(<= 10 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2960#(<= 19 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:40:14,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {2960#(<= 19 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2961#(<= 27 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:40:14,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {2961#(<= 27 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2962#(<= 34 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:14,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#(<= 34 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2963#(<= 40 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:40:14,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {2963#(<= 40 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2964#(<= 45 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:14,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(<= 45 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2965#(<= 49 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:40:14,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {2965#(<= 49 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2966#(<= 52 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:40:14,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {2966#(<= 52 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2967#(<= 54 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:14,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {2967#(<= 54 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2968#(<= 55 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:14,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {2968#(<= 55 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2969#(<= 55 main_~sum~0)} is VALID [2022-04-28 10:40:14,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {2969#(<= 55 main_~sum~0)} assume !(~i~0 < ~n~0); {2969#(<= 55 main_~sum~0)} is VALID [2022-04-28 10:40:14,349 INFO L272 TraceCheckUtils]: 19: Hoare triple {2969#(<= 55 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2970#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:14,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2971#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:14,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {2971#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2954#false} is VALID [2022-04-28 10:40:14,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-28 10:40:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017386302] [2022-04-28 10:40:14,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017386302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695960925] [2022-04-28 10:40:14,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:40:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:14,366 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:14,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 10:40:14,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:40:14,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:14,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:40:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:14,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:14,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-28 10:40:14,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-28 10:40:14,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-28 10:40:14,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-28 10:40:14,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-28 10:40:14,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-28 10:40:14,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2994#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:14,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2998#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:40:14,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {2998#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3002#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:40:14,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3006#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:40:14,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {3006#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3010#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:40:14,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {3010#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3014#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:40:14,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {3014#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3018#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:40:14,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3018#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3022#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:40:14,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {3022#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3026#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:40:14,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {3026#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3030#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:40:14,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {3030#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:40:14,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {3034#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2969#(<= 55 main_~sum~0)} is VALID [2022-04-28 10:40:14,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {2969#(<= 55 main_~sum~0)} assume !(~i~0 < ~n~0); {2969#(<= 55 main_~sum~0)} is VALID [2022-04-28 10:40:14,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {2969#(<= 55 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:14,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:14,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {3048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-28 10:40:14,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-28 10:40:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:14,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:26,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-28 10:40:26,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {3048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-28 10:40:26,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:26,840 INFO L272 TraceCheckUtils]: 19: Hoare triple {3064#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:26,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {3064#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3064#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:26,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {3071#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3064#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:26,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {3075#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3071#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:26,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {3079#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3075#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:40:26,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {3083#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3079#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:26,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {3087#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3083#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:26,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3087#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:26,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {3095#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3091#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:40:26,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {3099#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) 1) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) main_~i~0 (* 3 v_main_~i~0_146))) (not (<= (+ main_~i~0 1) v_main_~i~0_146)) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3095#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:40:26,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {3103#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int)) (or (< v_main_~i~0_146 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) (* 3 v_main_~i~0_146) (* main_~i~0 2))) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3099#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) 1) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) main_~i~0 (* 3 v_main_~i~0_146))) (not (<= (+ main_~i~0 1) v_main_~i~0_146)) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} is VALID [2022-04-28 10:40:26,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int) (v_main_~i~0_148 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_148)) (< v_main_~i~0_146 (+ 2 v_main_~i~0_148)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ (* 2 v_main_~i~0_148) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) main_~i~0 (* 3 v_main_~i~0_146))) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3103#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int)) (or (< v_main_~i~0_146 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) (* 3 v_main_~i~0_146) (* main_~i~0 2))) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} is VALID [2022-04-28 10:40:26,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int) (v_main_~i~0_148 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ (* 2 v_main_~i~0_148) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) (* 3 v_main_~i~0_146) (* main_~i~0 2) 1)) (< v_main_~i~0_146 (+ 2 v_main_~i~0_148)) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (< v_main_~i~0_148 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3107#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int) (v_main_~i~0_148 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_148)) (< v_main_~i~0_146 (+ 2 v_main_~i~0_148)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ (* 2 v_main_~i~0_148) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) main_~i~0 (* 3 v_main_~i~0_146))) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} is VALID [2022-04-28 10:40:26,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3111#(forall ((v_main_~i~0_146 Int) (aux_mod_aux_div_v_main_~sum~0_158_51_70 Int) (aux_div_aux_div_v_main_~sum~0_158_51_70 Int) (v_main_~i~0_148 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_158_51_70) (+ (* 2 v_main_~i~0_148) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_158_51_70 4) (* 3 v_main_~i~0_146) (* main_~i~0 2) 1)) (< v_main_~i~0_146 (+ 2 v_main_~i~0_148)) (> 0 aux_mod_aux_div_v_main_~sum~0_158_51_70) (< v_main_~i~0_148 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_158_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_158_51_70 (+ 5 v_main_~i~0_146))))} is VALID [2022-04-28 10:40:26,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-28 10:40:26,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-28 10:40:26,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-28 10:40:26,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-28 10:40:26,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-28 10:40:26,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-28 10:40:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:26,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695960925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:26,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:26,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 42 [2022-04-28 10:40:26,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:26,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128219048] [2022-04-28 10:40:26,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128219048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:26,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:26,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:40:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545149874] [2022-04-28 10:40:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:40:26,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:26,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:26,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:26,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:40:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:40:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:40:26,880 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:27,542 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:40:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:40:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:40:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2022-04-28 10:40:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2022-04-28 10:40:27,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 30 transitions. [2022-04-28 10:40:27,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:27,566 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:40:27,566 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:40:27,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=418, Invalid=2662, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:40:27,567 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:27,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:40:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:40:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 10:40:27,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:27,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,602 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,602 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:27,603 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:40:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:40:27,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:27,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:27,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:40:27,603 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:40:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:27,606 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:40:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:40:27,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:27,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:27,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:27,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 10:40:27,611 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 10:40:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:27,611 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 10:40:27,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:27,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 10:40:27,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 10:40:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:40:27,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:27,634 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:27,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 10:40:27,846 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -919639272, now seen corresponding path program 23 times [2022-04-28 10:40:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:27,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309643402] [2022-04-28 10:40:27,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:27,849 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash -919639272, now seen corresponding path program 24 times [2022-04-28 10:40:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:27,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403599625] [2022-04-28 10:40:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:28,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-28 10:40:28,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-28 10:40:28,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:28,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-28 10:40:28,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3328#(<= 0 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:40:28,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {3328#(<= 0 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3329#(<= 11 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:40:28,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {3329#(<= 11 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3330#(<= 21 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:40:28,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#(<= 21 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3331#(<= 30 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:40:28,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {3331#(<= 30 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3332#(<= 38 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:40:28,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {3332#(<= 38 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3333#(<= 45 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:28,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(<= 45 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3334#(<= 51 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:40:28,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {3334#(<= 51 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3335#(<= 56 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:28,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(<= 56 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3336#(<= 60 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:40:28,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {3336#(<= 60 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#(<= 63 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:40:28,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {3337#(<= 63 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3338#(<= 65 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:28,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {3338#(<= 65 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3339#(<= 66 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:28,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {3339#(<= 66 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3340#(<= 66 main_~sum~0)} is VALID [2022-04-28 10:40:28,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {3340#(<= 66 main_~sum~0)} assume !(~i~0 < ~n~0); {3340#(<= 66 main_~sum~0)} is VALID [2022-04-28 10:40:28,063 INFO L272 TraceCheckUtils]: 20: Hoare triple {3340#(<= 66 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3341#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:28,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {3341#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3342#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:28,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {3342#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3324#false} is VALID [2022-04-28 10:40:28,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-28 10:40:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:28,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403599625] [2022-04-28 10:40:28,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403599625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:28,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820363396] [2022-04-28 10:40:28,065 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:40:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:28,067 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 10:40:28,104 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:40:28,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:28,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:40:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:28,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:28,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2022-04-28 10:40:28,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-28 10:40:28,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-28 10:40:28,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-28 10:40:28,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-28 10:40:28,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-28 10:40:28,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3365#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:28,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {3365#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3369#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:40:28,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3373#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:40:28,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {3373#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3377#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:40:28,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3381#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:40:28,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {3381#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3385#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:40:28,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {3385#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3389#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:40:28,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {3389#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3393#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:40:28,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {3393#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3397#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:40:28,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {3397#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3401#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:40:28,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {3401#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3405#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:40:28,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {3405#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3409#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:40:28,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {3409#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3340#(<= 66 main_~sum~0)} is VALID [2022-04-28 10:40:28,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {3340#(<= 66 main_~sum~0)} assume !(~i~0 < ~n~0); {3340#(<= 66 main_~sum~0)} is VALID [2022-04-28 10:40:28,676 INFO L272 TraceCheckUtils]: 20: Hoare triple {3340#(<= 66 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:28,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:28,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {3423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3324#false} is VALID [2022-04-28 10:40:28,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-28 10:40:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 66 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:28,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:40:47,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-28 10:40:47,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {3423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3324#false} is VALID [2022-04-28 10:40:47,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:47,537 INFO L272 TraceCheckUtils]: 20: Hoare triple {3439#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:47,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {3439#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3439#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:47,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {3446#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3439#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:40:47,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {3450#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3446#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:47,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3450#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:40:47,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {3458#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3454#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:47,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {3462#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3458#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:47,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {3466#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3462#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:40:47,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3466#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:40:47,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {3474#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_170 Int)) (or (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) 1) (+ (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_170))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3470#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:40:47,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {3478#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 (* main_~i~0 2) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (< v_main_~i~0_170 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3474#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_170 Int)) (or (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) 1) (+ (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_170))))} is VALID [2022-04-28 10:40:47,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {3482#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_172) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (not (<= (+ main_~i~0 1) v_main_~i~0_172))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3478#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 (* main_~i~0 2) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (< v_main_~i~0_170 (+ main_~i~0 2))))} is VALID [2022-04-28 10:40:47,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 (* 2 v_main_~i~0_172) (* main_~i~0 2) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4) 1)) (< v_main_~i~0_172 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3482#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_172) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4))) (not (<= (+ main_~i~0 1) v_main_~i~0_172))))} is VALID [2022-04-28 10:40:47,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {3490#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_174 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_174)) (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 2 v_main_~i~0_174) (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_172) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4) 1)) (< v_main_~i~0_172 (+ 2 v_main_~i~0_174))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3486#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 3 v_main_~i~0_170) main_~sum~0 (* 2 v_main_~i~0_172) (* main_~i~0 2) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4) 1)) (< v_main_~i~0_172 (+ main_~i~0 2))))} is VALID [2022-04-28 10:40:47,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3490#(forall ((aux_div_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_174 Int) (aux_mod_aux_div_v_main_~sum~0_183_51_70 Int) (v_main_~i~0_172 Int) (v_main_~i~0_170 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_174)) (> 0 aux_mod_aux_div_v_main_~sum~0_183_51_70) (<= aux_div_aux_div_v_main_~sum~0_183_51_70 (+ 5 v_main_~i~0_170)) (< v_main_~i~0_170 (+ 2 v_main_~i~0_172)) (>= aux_mod_aux_div_v_main_~sum~0_183_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_183_51_70) (+ (* 2 v_main_~i~0_174) (* 3 v_main_~i~0_170) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_172) (* aux_div_aux_div_v_main_~sum~0_183_51_70 4) 1)) (< v_main_~i~0_172 (+ 2 v_main_~i~0_174))))} is VALID [2022-04-28 10:40:47,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2022-04-28 10:40:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:47,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820363396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:40:47,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:40:47,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2022-04-28 10:40:47,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:40:47,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309643402] [2022-04-28 10:40:47,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309643402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:40:47,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:40:47,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:40:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435791478] [2022-04-28 10:40:47,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:40:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:40:47,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:40:47,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:47,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:47,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:40:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:40:47,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=1577, Unknown=1, NotChecked=0, Total=1980 [2022-04-28 10:40:47,594 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:48,375 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:40:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:40:48,375 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:40:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:40:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-04-28 10:40:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-04-28 10:40:48,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 31 transitions. [2022-04-28 10:40:48,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:48,401 INFO L225 Difference]: With dead ends: 31 [2022-04-28 10:40:48,401 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:40:48,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=477, Invalid=3062, Unknown=1, NotChecked=0, Total=3540 [2022-04-28 10:40:48,402 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:40:48,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:40:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:40:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:40:48,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:40:48,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,451 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,451 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:48,451 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:40:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:40:48,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:48,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:48,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:40:48,452 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 10:40:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:40:48,452 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 10:40:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:40:48,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:40:48,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:40:48,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:40:48,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:40:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 10:40:48,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 10:40:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:40:48,453 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 10:40:48,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:40:48,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 10:40:48,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:40:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 10:40:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:40:48,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:40:48,481 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:40:48,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 10:40:48,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:40:48,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:40:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:40:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1591342470, now seen corresponding path program 25 times [2022-04-28 10:40:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:40:48,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1210134771] [2022-04-28 10:40:48,684 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:40:48,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:40:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1591342470, now seen corresponding path program 26 times [2022-04-28 10:40:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:40:48,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806449217] [2022-04-28 10:40:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:40:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:40:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:40:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:48,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-28 10:40:48,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-28 10:40:48,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-28 10:40:48,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:40:48,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-28 10:40:48,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-28 10:40:48,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-28 10:40:48,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-28 10:40:48,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-28 10:40:48,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3715#(<= 0 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:40:48,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {3715#(<= 0 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3716#(<= 12 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:40:48,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {3716#(<= 12 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3717#(<= 23 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:40:48,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {3717#(<= 23 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3718#(<= 33 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:40:48,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {3718#(<= 33 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3719#(<= 42 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:40:48,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {3719#(<= 42 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3720#(<= 50 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:40:48,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {3720#(<= 50 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3721#(<= 57 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:48,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {3721#(<= 57 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3722#(<= 63 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:40:48,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {3722#(<= 63 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3723#(<= 68 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:40:48,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {3723#(<= 68 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3724#(<= 72 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:40:48,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#(<= 72 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3725#(<= 75 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:40:48,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {3725#(<= 75 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3726#(<= 77 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:40:48,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {3726#(<= 77 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3727#(<= 78 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:40:48,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {3727#(<= 78 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3728#(<= 78 main_~sum~0)} is VALID [2022-04-28 10:40:48,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {3728#(<= 78 main_~sum~0)} assume !(~i~0 < ~n~0); {3728#(<= 78 main_~sum~0)} is VALID [2022-04-28 10:40:48,900 INFO L272 TraceCheckUtils]: 21: Hoare triple {3728#(<= 78 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:40:48,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:40:48,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {3730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3711#false} is VALID [2022-04-28 10:40:48,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-28 10:40:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:48,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:40:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806449217] [2022-04-28 10:40:48,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806449217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:40:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641210562] [2022-04-28 10:40:48,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:40:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:40:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:40:48,902 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:40:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 10:40:48,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:40:48,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:40:48,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:40:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:40:48,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:40:49,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2022-04-28 10:40:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-28 10:40:49,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-28 10:40:49,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-28 10:40:49,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-28 10:40:49,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-28 10:40:49,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3753#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:40:49,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3757#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:40:49,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {3757#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3761#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:40:49,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3765#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:40:49,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3769#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:40:49,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3773#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:40:49,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3777#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:40:49,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {3777#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3781#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:40:49,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {3781#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3785#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:40:49,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {3785#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3789#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:40:49,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {3789#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3793#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:40:49,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {3793#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3797#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:40:49,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3801#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:40:49,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {3801#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3728#(<= 78 main_~sum~0)} is VALID [2022-04-28 10:40:49,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {3728#(<= 78 main_~sum~0)} assume !(~i~0 < ~n~0); {3728#(<= 78 main_~sum~0)} is VALID [2022-04-28 10:40:49,560 INFO L272 TraceCheckUtils]: 21: Hoare triple {3728#(<= 78 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:40:49,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:40:49,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3711#false} is VALID [2022-04-28 10:40:49,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-28 10:40:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:40:49,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:41:06,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-28 10:41:06,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3711#false} is VALID [2022-04-28 10:41:06,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:06,704 INFO L272 TraceCheckUtils]: 21: Hoare triple {3831#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:06,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {3831#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3831#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:06,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {3838#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3831#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:06,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3838#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:06,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {3846#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3842#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:41:06,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3850#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3846#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:06,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3850#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:06,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {3858#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3854#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:06,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3858#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:41:06,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {3866#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* aux_div_v_main_~sum~0_210_51 2))) (<= aux_div_v_main_~i~0_196_70 (+ main_~i~0 6)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) 1) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 main_~i~0)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (+ aux_div_v_main_~sum~0_210_51 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3862#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:41:06,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {3870#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= aux_div_v_main_~i~0_196_70 (+ 7 main_~i~0)) (<= aux_div_v_main_~sum~0_210_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70))) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 (* main_~i~0 2))) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (div (+ main_~sum~0 main_~i~0) (- 2)) (+ aux_div_v_main_~sum~0_210_51 main_~i~0 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3866#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* aux_div_v_main_~sum~0_210_51 2))) (<= aux_div_v_main_~i~0_196_70 (+ main_~i~0 6)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) 1) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 main_~i~0)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (+ aux_div_v_main_~sum~0_210_51 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70)))))} is VALID [2022-04-28 10:41:06,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {3874#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 main_~i~0 2)) (<= aux_div_v_main_~i~0_196_70 (+ main_~i~0 8)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~i~0 1)) (<= 1 (+ main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~i~0_198_49))) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= aux_div_v_main_~sum~0_210_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70) 1)) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 2 (* main_~i~0 3)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3870#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= aux_div_v_main_~i~0_196_70 (+ 7 main_~i~0)) (<= aux_div_v_main_~sum~0_210_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70))) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 (* main_~i~0 2))) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (div (+ main_~sum~0 main_~i~0) (- 2)) (+ aux_div_v_main_~sum~0_210_51 main_~i~0 1))))} is VALID [2022-04-28 10:41:06,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {3878#(forall ((v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= 1 (+ (* 2 v_main_~i~0_199) main_~sum~0 main_~i~0 (* 2 aux_div_v_main_~i~0_198_49))) (not (<= (+ main_~i~0 1) v_main_~i~0_199)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 main_~i~0 2)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3874#(forall ((aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 main_~i~0 2)) (<= aux_div_v_main_~i~0_196_70 (+ main_~i~0 8)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~i~0 1)) (<= 1 (+ main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~i~0_198_49))) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= aux_div_v_main_~sum~0_210_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_196_70) 1)) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) main_~sum~0 2 (* main_~i~0 3)))))} is VALID [2022-04-28 10:41:06,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {3882#(forall ((v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 3 (* main_~i~0 2))) (< v_main_~i~0_199 (+ main_~i~0 2)) (<= 0 (+ (* 2 v_main_~i~0_199) main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~i~0_198_49))) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3878#(forall ((v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= 1 (+ (* 2 v_main_~i~0_199) main_~sum~0 main_~i~0 (* 2 aux_div_v_main_~i~0_198_49))) (not (<= (+ main_~i~0 1) v_main_~i~0_199)) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 main_~i~0 2)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} is VALID [2022-04-28 10:41:07,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {3886#(forall ((v_main_~i~0_201 Int) (v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_201))) (<= 0 (+ (* 2 v_main_~i~0_199) main_~sum~0 main_~i~0 (* 2 aux_div_v_main_~i~0_198_49) (* 2 v_main_~i~0_201))) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (< v_main_~i~0_199 (+ 2 v_main_~i~0_201)) (not (<= (+ main_~i~0 1) v_main_~i~0_201)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3882#(forall ((v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 3 (* main_~i~0 2))) (< v_main_~i~0_199 (+ main_~i~0 2)) (<= 0 (+ (* 2 v_main_~i~0_199) main_~sum~0 (* main_~i~0 2) (* 2 aux_div_v_main_~i~0_198_49))) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} is VALID [2022-04-28 10:41:07,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3886#(forall ((v_main_~i~0_201 Int) (v_main_~i~0_199 Int) (aux_div_v_main_~i~0_196_70 Int) (aux_div_v_main_~i~0_198_49 Int) (aux_div_v_main_~sum~0_210_51 Int)) (or (<= (* 2 aux_div_v_main_~i~0_196_70) (+ (* aux_div_v_main_~sum~0_210_51 3) (* 3 v_main_~i~0_199) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_201))) (<= 0 (+ (* 2 v_main_~i~0_199) main_~sum~0 main_~i~0 (* 2 aux_div_v_main_~i~0_198_49) (* 2 v_main_~i~0_201))) (<= (+ (* 2 aux_div_v_main_~i~0_196_70) (* 2 aux_div_v_main_~i~0_198_49)) (+ (* aux_div_v_main_~sum~0_210_51 3) v_main_~i~0_199 1)) (<= aux_div_v_main_~i~0_196_70 (+ 8 v_main_~i~0_199)) (<= aux_div_v_main_~i~0_198_49 (+ aux_div_v_main_~sum~0_210_51 2 v_main_~i~0_199)) (<= (* 3 aux_div_v_main_~i~0_196_70) (+ aux_div_v_main_~sum~0_210_51 5)) (< v_main_~i~0_199 (+ 2 v_main_~i~0_201)) (not (<= (+ main_~i~0 1) v_main_~i~0_201)) (<= aux_div_v_main_~sum~0_210_51 (+ (* 2 aux_div_v_main_~i~0_196_70) v_main_~i~0_199 1))))} is VALID [2022-04-28 10:41:07,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-28 10:41:07,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-28 10:41:07,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-28 10:41:07,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-28 10:41:07,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-28 10:41:07,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2022-04-28 10:41:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:07,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641210562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:41:07,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:41:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 48 [2022-04-28 10:41:07,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:07,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1210134771] [2022-04-28 10:41:07,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1210134771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:07,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:07,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:41:07,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451473769] [2022-04-28 10:41:07,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:41:07,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:07,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:07,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:41:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:41:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1796, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:41:07,031 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:07,873 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:41:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:41:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:41:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2022-04-28 10:41:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2022-04-28 10:41:07,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 32 transitions. [2022-04-28 10:41:07,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:07,910 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:41:07,910 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:41:07,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=540, Invalid=3492, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:41:07,912 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:07,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:41:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:41:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 10:41:07,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:07,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,969 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,969 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:07,980 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:41:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:41:07,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:07,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:07,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:41:07,980 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 10:41:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:07,981 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 10:41:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:41:07,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:07,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:07,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:07,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 10:41:07,982 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 10:41:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:07,982 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 10:41:07,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:07,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 10:41:08,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 10:41:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:41:08,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:08,007 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:41:08,024 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-28 10:41:08,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:41:08,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:08,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2122365144, now seen corresponding path program 27 times [2022-04-28 10:41:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:08,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257672104] [2022-04-28 10:41:08,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:41:08,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:41:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2122365144, now seen corresponding path program 28 times [2022-04-28 10:41:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:08,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706191924] [2022-04-28 10:41:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:08,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-28 10:41:08,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-28 10:41:08,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:41:08,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-28 10:41:08,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4119#(<= 0 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:41:08,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {4119#(<= 0 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4120#(<= 13 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:41:08,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {4120#(<= 13 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4121#(<= 25 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:41:08,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4121#(<= 25 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4122#(<= 36 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:41:08,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {4122#(<= 36 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4123#(<= 46 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:41:08,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {4123#(<= 46 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4124#(<= 55 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:41:08,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {4124#(<= 55 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4125#(<= 63 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:41:08,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {4125#(<= 63 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4126#(<= 70 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:08,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {4126#(<= 70 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4127#(<= 76 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:41:08,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {4127#(<= 76 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4128#(<= 81 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:08,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {4128#(<= 81 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4129#(<= 85 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:41:08,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {4129#(<= 85 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4130#(<= 88 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:41:08,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {4130#(<= 88 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4131#(<= 90 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:08,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {4131#(<= 90 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4132#(<= 91 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:08,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {4132#(<= 91 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4133#(<= 91 main_~sum~0)} is VALID [2022-04-28 10:41:08,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 91 main_~sum~0)} assume !(~i~0 < ~n~0); {4133#(<= 91 main_~sum~0)} is VALID [2022-04-28 10:41:08,445 INFO L272 TraceCheckUtils]: 22: Hoare triple {4133#(<= 91 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:41:08,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {4134#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:41:08,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {4135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4115#false} is VALID [2022-04-28 10:41:08,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-28 10:41:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:08,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706191924] [2022-04-28 10:41:08,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706191924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:08,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139508120] [2022-04-28 10:41:08,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:41:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:08,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:41:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 10:41:08,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:41:08,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:08,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:41:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:08,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:09,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-28 10:41:09,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4158#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:41:09,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {4158#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4162#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:41:09,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {4162#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4166#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:41:09,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {4166#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4170#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:41:09,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {4170#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4174#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:41:09,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {4174#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4178#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:41:09,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {4178#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4182#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:41:09,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {4182#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4186#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:41:09,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {4186#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4190#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:41:09,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4194#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:41:09,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {4194#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4198#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:41:09,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {4198#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4202#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:41:09,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {4202#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4206#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:41:09,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {4206#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4210#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:41:09,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {4210#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4133#(<= 91 main_~sum~0)} is VALID [2022-04-28 10:41:09,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 91 main_~sum~0)} assume !(~i~0 < ~n~0); {4133#(<= 91 main_~sum~0)} is VALID [2022-04-28 10:41:09,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {4133#(<= 91 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:09,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:09,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {4224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4115#false} is VALID [2022-04-28 10:41:09,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-28 10:41:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:09,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:41:26,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-28 10:41:26,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {4224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4115#false} is VALID [2022-04-28 10:41:26,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:26,046 INFO L272 TraceCheckUtils]: 22: Hoare triple {4240#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:26,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {4240#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {4240#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:26,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4247#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4240#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:26,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4247#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:26,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {4255#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4251#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:41:26,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {4259#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4255#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:26,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {4263#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4259#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:26,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {4267#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4263#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:26,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {4271#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4267#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:41:26,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {4275#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) 1) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0)) (not (<= (+ main_~i~0 1) v_main_~i~0_224)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4271#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:41:26,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {4279#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 (* main_~i~0 2))) (< v_main_~i~0_224 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) 1) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0)) (not (<= (+ main_~i~0 1) v_main_~i~0_224)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is VALID [2022-04-28 10:41:26,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {4283#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_226)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_226))) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4279#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 (* main_~i~0 2))) (< v_main_~i~0_224 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is VALID [2022-04-28 10:41:26,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {4287#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 (* 2 v_main_~i~0_226) (* main_~i~0 2) 1)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70) (< v_main_~i~0_226 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4283#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_226)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_226))) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is VALID [2022-04-28 10:41:26,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {4291#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_226) (* 2 v_main_~i~0_228) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_228)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4287#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 (* 2 v_main_~i~0_226) (* main_~i~0 2) 1)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70) (< v_main_~i~0_226 (+ main_~i~0 2))))} is VALID [2022-04-28 10:41:28,217 WARN L290 TraceCheckUtils]: 8: Hoare triple {4295#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (< v_main_~i~0_228 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 2 (* 2 v_main_~i~0_226) (* main_~i~0 2) (* 2 v_main_~i~0_228))) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4291#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_226) (* 2 v_main_~i~0_228) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_228)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is UNKNOWN [2022-04-28 10:41:28,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {4299#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_230 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (< v_main_~i~0_228 (+ 2 v_main_~i~0_230)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_226) (* 2 v_main_~i~0_230) (* 2 v_main_~i~0_228))) (not (<= (+ main_~i~0 1) v_main_~i~0_230)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4295#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (< v_main_~i~0_228 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 2 (* 2 v_main_~i~0_226) (* main_~i~0 2) (* 2 v_main_~i~0_228))) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is VALID [2022-04-28 10:41:28,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4299#(forall ((aux_div_aux_div_v_main_~sum~0_239_51_70 Int) (v_main_~i~0_224 Int) (v_main_~i~0_230 Int) (v_main_~i~0_228 Int) (v_main_~i~0_226 Int) (aux_mod_aux_div_v_main_~sum~0_239_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_239_51_70 2) (< v_main_~i~0_226 (+ 2 v_main_~i~0_228)) (< v_main_~i~0_228 (+ 2 v_main_~i~0_230)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_239_51_70) (+ (* 3 v_main_~i~0_224) (* aux_div_aux_div_v_main_~sum~0_239_51_70 4) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_226) (* 2 v_main_~i~0_230) (* 2 v_main_~i~0_228))) (not (<= (+ main_~i~0 1) v_main_~i~0_230)) (< v_main_~i~0_224 (+ 2 v_main_~i~0_226)) (<= aux_div_aux_div_v_main_~sum~0_239_51_70 (+ 5 v_main_~i~0_224)) (> 0 aux_mod_aux_div_v_main_~sum~0_239_51_70)))} is VALID [2022-04-28 10:41:28,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-28 10:41:28,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-28 10:41:28,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-28 10:41:28,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-28 10:41:28,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-28 10:41:28,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4114#true} is VALID [2022-04-28 10:41:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:28,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139508120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:41:28,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:41:28,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 51 [2022-04-28 10:41:28,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:28,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257672104] [2022-04-28 10:41:28,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257672104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:28,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:28,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:41:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748280835] [2022-04-28 10:41:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:41:28,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:28,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:28,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:28,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:41:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:28,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:41:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:41:28,306 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:29,243 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:41:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:41:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:41:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2022-04-28 10:41:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2022-04-28 10:41:29,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 33 transitions. [2022-04-28 10:41:29,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:29,272 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:41:29,272 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:41:29,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=607, Invalid=3949, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:41:29,274 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:29,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:41:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:41:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 10:41:29,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:29,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,337 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,337 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:29,338 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:41:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:41:29,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:29,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:29,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:41:29,338 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 10:41:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:29,339 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 10:41:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:41:29,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:29,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:29,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:29,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 10:41:29,340 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 10:41:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:29,340 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 10:41:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:29,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 10:41:29,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 10:41:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:41:29,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:29,367 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:41:29,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:41:29,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:29,567 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1404198854, now seen corresponding path program 29 times [2022-04-28 10:41:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925254235] [2022-04-28 10:41:29,570 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:41:29,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:41:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1404198854, now seen corresponding path program 30 times [2022-04-28 10:41:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:29,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269256958] [2022-04-28 10:41:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:29,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-28 10:41:29,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-28 10:41:29,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-28 10:41:29,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:41:29,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-28 10:41:29,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-28 10:41:29,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-28 10:41:29,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-28 10:41:29,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-28 10:41:29,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4540#(<= 0 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:41:29,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {4540#(<= 0 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4541#(<= 14 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:41:29,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {4541#(<= 14 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4542#(<= 27 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:41:29,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {4542#(<= 27 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4543#(<= 39 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:41:29,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {4543#(<= 39 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4544#(<= 50 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:41:29,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {4544#(<= 50 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4545#(<= 60 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:41:29,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {4545#(<= 60 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4546#(<= 69 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:41:29,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {4546#(<= 69 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4547#(<= 77 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:41:29,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {4547#(<= 77 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4548#(<= 84 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:29,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {4548#(<= 84 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4549#(<= 90 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:41:29,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {4549#(<= 90 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4550#(<= 95 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:29,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {4550#(<= 95 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4551#(<= 99 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:41:29,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {4551#(<= 99 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4552#(<= 102 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:41:29,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#(<= 102 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4553#(<= 104 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:29,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#(<= 104 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4554#(<= 105 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:29,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {4554#(<= 105 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4555#(<= 105 main_~sum~0)} is VALID [2022-04-28 10:41:29,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#(<= 105 main_~sum~0)} assume !(~i~0 < ~n~0); {4555#(<= 105 main_~sum~0)} is VALID [2022-04-28 10:41:29,803 INFO L272 TraceCheckUtils]: 23: Hoare triple {4555#(<= 105 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:41:29,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {4556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:41:29,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {4557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4536#false} is VALID [2022-04-28 10:41:29,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-28 10:41:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269256958] [2022-04-28 10:41:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269256958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869656559] [2022-04-28 10:41:29,804 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:41:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:29,805 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:41:29,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 10:41:29,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:41:29,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:29,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:41:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:29,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:30,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-28 10:41:30,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-28 10:41:30,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-28 10:41:30,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-28 10:41:30,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-28 10:41:30,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-28 10:41:30,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4580#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:41:30,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {4580#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4584#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:41:30,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {4584#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4588#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:41:30,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {4588#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4592#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:41:30,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {4592#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4596#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:41:30,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {4596#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4600#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:41:30,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {4600#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4604#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:41:30,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {4604#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4608#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:41:30,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {4608#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4612#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:41:30,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {4612#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:41:30,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {4616#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:41:30,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {4620#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:41:30,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {4624#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4628#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:41:30,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {4628#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4632#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:41:30,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {4632#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4636#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:41:30,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {4636#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4555#(<= 105 main_~sum~0)} is VALID [2022-04-28 10:41:30,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#(<= 105 main_~sum~0)} assume !(~i~0 < ~n~0); {4555#(<= 105 main_~sum~0)} is VALID [2022-04-28 10:41:30,595 INFO L272 TraceCheckUtils]: 23: Hoare triple {4555#(<= 105 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:30,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:30,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-28 10:41:30,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-28 10:41:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 105 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:30,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:41:47,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-28 10:41:47,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {4650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-28 10:41:47,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:47,281 INFO L272 TraceCheckUtils]: 23: Hoare triple {4666#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:47,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {4666#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {4666#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:47,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {4673#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4666#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:41:47,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {4677#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4673#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:47,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4677#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:41:47,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {4685#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4681#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:47,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {4689#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4685#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:47,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {4693#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4689#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:41:47,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {4697#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4693#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:41:47,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4701#(forall ((v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (not (<= (+ main_~i~0 1) v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4697#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:41:47,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {4705#(forall ((v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (< v_main_~i~0_254 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 (* 3 v_main_~i~0_254) (* main_~i~0 2))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4701#(forall ((v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (not (<= (+ main_~i~0 1) v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254)))))} is VALID [2022-04-28 10:41:47,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {4709#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_256)) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4705#(forall ((v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (< v_main_~i~0_254 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 (* 3 v_main_~i~0_254) (* main_~i~0 2))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2)))} is VALID [2022-04-28 10:41:47,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {4713#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* main_~i~0 2) 1)) (< v_main_~i~0_256 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4709#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_256)) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is VALID [2022-04-28 10:41:47,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {4717#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_258 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_258)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) 1)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4713#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* main_~i~0 2) 1)) (< v_main_~i~0_256 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is VALID [2022-04-28 10:41:47,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_258 Int)) (or (< v_main_~i~0_258 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 2 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* main_~i~0 2))) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4717#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_258 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_258)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) 1)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is VALID [2022-04-28 10:41:47,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {4725#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_260 Int) (v_main_~i~0_258 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_260)) (< v_main_~i~0_258 (+ 2 v_main_~i~0_260)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 2 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* 2 v_main_~i~0_260))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4721#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_258 Int)) (or (< v_main_~i~0_258 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 2 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* main_~i~0 2))) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is VALID [2022-04-28 10:41:49,421 WARN L290 TraceCheckUtils]: 7: Hoare triple {4729#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_260 Int) (v_main_~i~0_258 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 3 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* 2 v_main_~i~0_260) (* main_~i~0 2))) (< v_main_~i~0_258 (+ 2 v_main_~i~0_260)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (< v_main_~i~0_260 (+ main_~i~0 2)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4725#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_260 Int) (v_main_~i~0_258 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_260)) (< v_main_~i~0_258 (+ 2 v_main_~i~0_260)) (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 main_~i~0 2 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* 2 v_main_~i~0_260))) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is UNKNOWN [2022-04-28 10:41:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4729#(forall ((v_main_~i~0_256 Int) (v_main_~i~0_254 Int) (aux_mod_aux_div_v_main_~sum~0_270_51_70 Int) (aux_div_aux_div_v_main_~sum~0_270_51_70 Int) (v_main_~i~0_260 Int) (v_main_~i~0_258 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (+ (* 2 v_main_~i~0_258) (* aux_div_aux_div_v_main_~sum~0_270_51_70 4) main_~sum~0 3 (* 3 v_main_~i~0_254) (* 2 v_main_~i~0_256) (* 2 v_main_~i~0_260) (* main_~i~0 2))) (< v_main_~i~0_258 (+ 2 v_main_~i~0_260)) (<= aux_div_aux_div_v_main_~sum~0_270_51_70 (+ 5 v_main_~i~0_254)) (> 0 aux_mod_aux_div_v_main_~sum~0_270_51_70) (>= aux_mod_aux_div_v_main_~sum~0_270_51_70 2) (< v_main_~i~0_256 (+ 2 v_main_~i~0_258)) (< v_main_~i~0_260 (+ main_~i~0 2)) (< v_main_~i~0_254 (+ 2 v_main_~i~0_256))))} is VALID [2022-04-28 10:41:49,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-28 10:41:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:49,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869656559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:41:49,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:41:49,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 54 [2022-04-28 10:41:49,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:41:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1925254235] [2022-04-28 10:41:49,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1925254235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:41:49,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:41:49,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:41:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857487444] [2022-04-28 10:41:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:41:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:41:49,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:41:49,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:49,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:49,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:41:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:41:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2273, Unknown=1, NotChecked=0, Total=2862 [2022-04-28 10:41:49,490 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:50,603 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:41:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:41:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:41:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:41:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2022-04-28 10:41:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2022-04-28 10:41:50,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 34 transitions. [2022-04-28 10:41:50,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:50,630 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:41:50,630 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:41:50,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=678, Invalid=4433, Unknown=1, NotChecked=0, Total=5112 [2022-04-28 10:41:50,631 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:41:50,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:41:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:41:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:41:50,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:41:50,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,693 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:50,698 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:41:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:41:50,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:50,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:50,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:41:50,699 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 10:41:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:41:50,700 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 10:41:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:41:50,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:41:50,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:41:50,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:41:50,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:41:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 10:41:50,703 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 10:41:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:41:50,703 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 10:41:50,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:41:50,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 10:41:50,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:41:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 10:41:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:41:50,733 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:41:50,733 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:41:50,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 10:41:50,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:41:50,934 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:41:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:41:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash 615880344, now seen corresponding path program 31 times [2022-04-28 10:41:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:41:50,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932252986] [2022-04-28 10:41:50,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:41:50,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:41:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash 615880344, now seen corresponding path program 32 times [2022-04-28 10:41:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:41:50,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954939978] [2022-04-28 10:41:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:41:50,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:41:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:41:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:51,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:41:51,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-28 10:41:51,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-28 10:41:51,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4978#(<= 0 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:41:51,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {4978#(<= 0 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4979#(<= 15 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:41:51,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#(<= 15 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4980#(<= 29 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:41:51,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {4980#(<= 29 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4981#(<= 42 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:41:51,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {4981#(<= 42 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4982#(<= 54 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:41:51,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {4982#(<= 54 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4983#(<= 65 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:41:51,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {4983#(<= 65 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4984#(<= 75 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:41:51,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {4984#(<= 75 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4985#(<= 84 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:41:51,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {4985#(<= 84 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4986#(<= 92 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:41:51,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {4986#(<= 92 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4987#(<= 99 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:51,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {4987#(<= 99 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4988#(<= 105 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:41:51,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {4988#(<= 105 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4989#(<= 110 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:41:51,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {4989#(<= 110 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4990#(<= 114 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:41:51,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#(<= 114 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4991#(<= 117 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:41:51,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {4991#(<= 117 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4992#(<= 119 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:41:51,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {4992#(<= 119 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4993#(<= 120 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:41:51,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {4993#(<= 120 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4994#(<= 120 main_~sum~0)} is VALID [2022-04-28 10:41:51,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {4994#(<= 120 main_~sum~0)} assume !(~i~0 < ~n~0); {4994#(<= 120 main_~sum~0)} is VALID [2022-04-28 10:41:51,206 INFO L272 TraceCheckUtils]: 24: Hoare triple {4994#(<= 120 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4995#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:41:51,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {4995#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4996#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:41:51,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {4996#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4974#false} is VALID [2022-04-28 10:41:51,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-28 10:41:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:41:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954939978] [2022-04-28 10:41:51,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954939978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:41:51,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629090370] [2022-04-28 10:41:51,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:41:51,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:41:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:41:51,211 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:41:51,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 10:41:51,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:41:51,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:41:51,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:41:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:41:51,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:41:52,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2022-04-28 10:41:52,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-28 10:41:52,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 10:41:52,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-28 10:41:52,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-28 10:41:52,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-28 10:41:52,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5019#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:41:52,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {5019#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5023#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:41:52,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {5023#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5027#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:41:52,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {5027#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5031#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:41:52,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {5031#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5035#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:41:52,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {5035#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:41:52,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:41:52,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {5043#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:41:52,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5051#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:41:52,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {5051#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5055#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:41:52,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {5055#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5059#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:41:52,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {5059#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5063#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:41:52,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5067#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:41:52,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {5067#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5071#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:41:52,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {5071#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5075#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:41:52,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5079#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:41:52,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {5079#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4994#(<= 120 main_~sum~0)} is VALID [2022-04-28 10:41:52,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {4994#(<= 120 main_~sum~0)} assume !(~i~0 < ~n~0); {4994#(<= 120 main_~sum~0)} is VALID [2022-04-28 10:41:52,084 INFO L272 TraceCheckUtils]: 24: Hoare triple {4994#(<= 120 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:41:52,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:41:52,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {5093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4974#false} is VALID [2022-04-28 10:41:52,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-28 10:41:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:41:52,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:42:31,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-28 10:42:31,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {5093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4974#false} is VALID [2022-04-28 10:42:31,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:42:31,545 INFO L272 TraceCheckUtils]: 24: Hoare triple {5109#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:42:31,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {5109#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {5109#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:42:31,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {5116#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5109#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:42:31,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {5120#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5116#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:42:31,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {5124#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5120#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:42:31,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {5128#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5124#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:42:31,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {5132#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5128#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:42:31,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {5136#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:42:31,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {5140#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5136#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:42:31,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {5144#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ main_~i~0 6)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) 1) (+ main_~sum~0 main_~i~0 (* aux_div_v_main_~sum~0_303_51 3))) (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* aux_div_v_main_~sum~0_303_51 2))) (<= (+ aux_div_v_main_~sum~0_303_51 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_286_70)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5140#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:42:31,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 main_~i~0)) (<= (div (+ main_~sum~0 main_~i~0) (- 2)) (+ aux_div_v_main_~sum~0_303_51 main_~i~0 1)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_286_70))) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5144#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ main_~i~0 6)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) 1) (+ main_~sum~0 main_~i~0 (* aux_div_v_main_~sum~0_303_51 3))) (<= 0 (+ main_~sum~0 (* main_~i~0 2) (* aux_div_v_main_~sum~0_303_51 2))) (<= (+ aux_div_v_main_~sum~0_303_51 1) (+ main_~i~0 (* 2 aux_div_v_main_~i~0_286_70)))))} is VALID [2022-04-28 10:42:31,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {5152#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_288)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 main_~i~0 (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (<= 2 (+ main_~sum~0 main_~i~0 v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 main_~i~0)) (<= (div (+ main_~sum~0 main_~i~0) (- 2)) (+ aux_div_v_main_~sum~0_303_51 main_~i~0 1)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ main_~i~0 (* 2 aux_div_v_main_~i~0_286_70))) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2)))))} is VALID [2022-04-28 10:42:31,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {5156#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= 1 (+ main_~sum~0 (* main_~i~0 2) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_288 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) 1 (* 2 v_main_~i~0_288))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5152#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_288)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 main_~i~0 (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (<= 2 (+ main_~sum~0 main_~i~0 v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is VALID [2022-04-28 10:42:31,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {5160#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) 1 (* 2 v_main_~i~0_288))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_290)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= 1 (+ main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5156#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= 1 (+ main_~sum~0 (* main_~i~0 2) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_288 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) 1 (* 2 v_main_~i~0_288))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is VALID [2022-04-28 10:42:31,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {5164#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= 0 (+ main_~sum~0 (* 2 v_main_~i~0_290) (* main_~i~0 2) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 2 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) (* 2 v_main_~i~0_288))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_290 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5160#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) 1 (* 2 v_main_~i~0_288))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_290)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= 1 (+ main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is VALID [2022-04-28 10:42:33,641 WARN L290 TraceCheckUtils]: 9: Hoare triple {5168#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= 0 (+ (* 2 v_main_~i~0_292) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_292)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5164#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= 0 (+ main_~sum~0 (* 2 v_main_~i~0_290) (* main_~i~0 2) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ main_~sum~0 2 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) (* 2 v_main_~i~0_288))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_290 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is UNKNOWN [2022-04-28 10:42:35,670 WARN L290 TraceCheckUtils]: 8: Hoare triple {5172#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= 0 (+ (* 2 v_main_~i~0_292) main_~sum~0 (* 2 v_main_~i~0_290) (* main_~i~0 2) v_main_~i~0_288 1 (* aux_div_v_main_~sum~0_305_49 2))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_292 (+ main_~i~0 2)) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) main_~sum~0 (* 2 v_main_~i~0_290) 3 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) (* 2 v_main_~i~0_288))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= 0 (+ (* 2 v_main_~i~0_292) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_292)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_290) (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is UNKNOWN [2022-04-28 10:42:46,058 WARN L290 TraceCheckUtils]: 7: Hoare triple {5176#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_294 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_294)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) (* 2 v_main_~i~0_294) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) 3 (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (< v_main_~i~0_292 (+ 2 v_main_~i~0_294)) (<= 0 (+ (* 2 v_main_~i~0_292) (* 2 v_main_~i~0_294) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 1 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (<= 0 (+ (* 2 v_main_~i~0_292) main_~sum~0 (* 2 v_main_~i~0_290) (* main_~i~0 2) v_main_~i~0_288 1 (* aux_div_v_main_~sum~0_305_49 2))) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_292 (+ main_~i~0 2)) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) main_~sum~0 (* 2 v_main_~i~0_290) 3 (* aux_div_v_main_~sum~0_303_51 3) (* main_~i~0 2) (* 2 v_main_~i~0_288))) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is UNKNOWN [2022-04-28 10:42:46,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5176#(forall ((aux_div_v_main_~sum~0_303_51 Int) (aux_div_v_main_~i~0_286_70 Int) (v_main_~i~0_288 Int) (v_main_~i~0_294 Int) (v_main_~i~0_292 Int) (aux_div_v_main_~sum~0_305_49 Int) (v_main_~i~0_290 Int)) (or (<= aux_div_v_main_~i~0_286_70 (+ 7 v_main_~i~0_288)) (not (<= (+ main_~i~0 1) v_main_~i~0_294)) (<= (* 3 aux_div_v_main_~i~0_286_70) (+ aux_div_v_main_~sum~0_303_51 5)) (<= (* 2 aux_div_v_main_~i~0_286_70) (+ (* 2 v_main_~i~0_292) (* 2 v_main_~i~0_294) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) 3 (* aux_div_v_main_~sum~0_303_51 3) (* 2 v_main_~i~0_288))) (<= aux_div_v_main_~sum~0_303_51 (+ (* 2 aux_div_v_main_~i~0_286_70) v_main_~i~0_288)) (< v_main_~i~0_290 (+ 2 v_main_~i~0_292)) (< v_main_~i~0_292 (+ 2 v_main_~i~0_294)) (<= 0 (+ (* 2 v_main_~i~0_292) (* 2 v_main_~i~0_294) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_290) v_main_~i~0_288 1 (* aux_div_v_main_~sum~0_305_49 2))) (<= aux_div_v_main_~sum~0_305_49 (+ aux_div_v_main_~sum~0_303_51 v_main_~i~0_288 1)) (< v_main_~i~0_288 (+ 2 v_main_~i~0_290)) (<= (+ (* 2 aux_div_v_main_~i~0_286_70) (* aux_div_v_main_~sum~0_305_49 2)) (+ (* aux_div_v_main_~sum~0_303_51 3) v_main_~i~0_288))))} is VALID [2022-04-28 10:42:46,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-28 10:42:46,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-28 10:42:46,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-28 10:42:46,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-28 10:42:46,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-28 10:42:46,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2022-04-28 10:42:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:46,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629090370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:42:46,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:42:46,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2022-04-28 10:42:46,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:42:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932252986] [2022-04-28 10:42:46,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932252986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:42:46,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:42:46,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:42:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552612762] [2022-04-28 10:42:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:42:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:42:46,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:42:46,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:46,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:46,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:42:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:42:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=2528, Unknown=6, NotChecked=0, Total=3192 [2022-04-28 10:42:46,283 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:47,765 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 10:42:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:42:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:42:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:42:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2022-04-28 10:42:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2022-04-28 10:42:47,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 35 transitions. [2022-04-28 10:42:47,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:47,793 INFO L225 Difference]: With dead ends: 35 [2022-04-28 10:42:47,793 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:42:47,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=753, Invalid=4941, Unknown=6, NotChecked=0, Total=5700 [2022-04-28 10:42:47,794 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:42:47,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:42:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:42:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:42:47,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:42:47,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,875 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,875 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:47,875 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:42:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:42:47,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:47,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:47,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:42:47,876 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 10:42:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:42:47,876 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 10:42:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:42:47,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:42:47,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:42:47,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:42:47,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:42:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 10:42:47,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 10:42:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:42:47,877 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 10:42:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:42:47,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 10:42:47,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:42:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 10:42:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:42:47,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:42:47,913 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:42:47,929 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-28 10:42:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:42:48,115 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:42:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:42:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1947810310, now seen corresponding path program 33 times [2022-04-28 10:42:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:42:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55207628] [2022-04-28 10:42:48,119 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:42:48,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:42:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1947810310, now seen corresponding path program 34 times [2022-04-28 10:42:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:42:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954304224] [2022-04-28 10:42:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:42:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:42:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:42:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:48,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-28 10:42:48,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-28 10:42:48,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-28 10:42:48,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:42:48,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-28 10:42:48,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-28 10:42:48,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-28 10:42:48,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-28 10:42:48,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-28 10:42:48,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5433#(<= 0 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-28 10:42:48,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {5433#(<= 0 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5434#(<= 16 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:42:48,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {5434#(<= 16 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5435#(<= 31 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:42:48,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {5435#(<= 31 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5436#(<= 45 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:42:48,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {5436#(<= 45 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5437#(<= 58 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:42:48,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5437#(<= 58 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5438#(<= 70 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:42:48,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {5438#(<= 70 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5439#(<= 81 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:42:48,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {5439#(<= 81 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5440#(<= 91 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:42:48,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#(<= 91 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5441#(<= 100 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:42:48,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {5441#(<= 100 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5442#(<= 108 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:42:48,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {5442#(<= 108 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5443#(<= 115 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:42:48,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {5443#(<= 115 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5444#(<= 121 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:42:48,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {5444#(<= 121 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5445#(<= 126 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:42:48,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {5445#(<= 126 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5446#(<= 130 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:42:48,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {5446#(<= 130 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5447#(<= 133 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:42:48,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {5447#(<= 133 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5448#(<= 135 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:42:48,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {5448#(<= 135 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5449#(<= 136 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:42:48,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#(<= 136 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5450#(<= 136 main_~sum~0)} is VALID [2022-04-28 10:42:48,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {5450#(<= 136 main_~sum~0)} assume !(~i~0 < ~n~0); {5450#(<= 136 main_~sum~0)} is VALID [2022-04-28 10:42:48,431 INFO L272 TraceCheckUtils]: 25: Hoare triple {5450#(<= 136 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5451#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:42:48,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {5451#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5452#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:42:48,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {5452#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5429#false} is VALID [2022-04-28 10:42:48,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-28 10:42:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:42:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954304224] [2022-04-28 10:42:48,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954304224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:42:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015525536] [2022-04-28 10:42:48,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:42:48,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:42:48,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:42:48,433 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:42:48,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 10:42:48,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:42:48,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:42:48,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:42:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:42:48,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:42:49,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-28 10:42:49,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-28 10:42:49,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-28 10:42:49,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-28 10:42:49,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-28 10:42:49,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-28 10:42:49,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5475#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:42:49,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {5475#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5479#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:42:49,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {5479#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5483#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:42:49,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {5483#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5487#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:42:49,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {5487#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5491#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:42:49,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {5491#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5495#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:42:49,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {5495#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5499#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:42:49,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {5499#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5503#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:42:49,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5503#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5507#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:42:49,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {5507#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5511#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:42:49,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {5511#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:42:49,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {5515#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5519#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:42:49,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {5519#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5523#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:42:49,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5527#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:42:49,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {5527#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5531#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:42:49,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {5531#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5535#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:42:49,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {5535#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5539#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-28 10:42:49,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {5539#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5450#(<= 136 main_~sum~0)} is VALID [2022-04-28 10:42:49,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {5450#(<= 136 main_~sum~0)} assume !(~i~0 < ~n~0); {5450#(<= 136 main_~sum~0)} is VALID [2022-04-28 10:42:49,431 INFO L272 TraceCheckUtils]: 25: Hoare triple {5450#(<= 136 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:42:49,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:42:49,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {5553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-28 10:42:49,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-28 10:42:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 136 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:42:49,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:13,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-28 10:43:13,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {5553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-28 10:43:13,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:13,372 INFO L272 TraceCheckUtils]: 25: Hoare triple {5569#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:13,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {5569#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {5569#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:43:13,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {5576#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5569#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:43:13,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {5580#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5576#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:43:13,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5580#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:43:13,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {5588#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5584#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:43:13,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {5592#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5588#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:43:13,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {5596#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5592#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:43:13,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {5600#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5596#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:43:13,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {5604#(forall ((aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (not (<= (+ main_~i~0 1) v_main_~i~0_320)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) 1) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5600#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:43:13,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {5608#(forall ((aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_320 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5604#(forall ((aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (not (<= (+ main_~i~0 1) v_main_~i~0_320)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) 1) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4)))))} is VALID [2022-04-28 10:43:13,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {5612#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_322))) (not (<= (+ main_~i~0 1) v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5608#(forall ((aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_320 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2)))} is VALID [2022-04-28 10:43:13,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {5616#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) 1 (* 2 v_main_~i~0_322))) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_322 (+ main_~i~0 2)) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5612#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_322))) (not (<= (+ main_~i~0 1) v_main_~i~0_322))))} is VALID [2022-04-28 10:43:14,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {5620#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (not (<= (+ main_~i~0 1) v_main_~i~0_324)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) 1 (* 2 v_main_~i~0_322))) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5616#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) 1 (* 2 v_main_~i~0_322))) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_322 (+ main_~i~0 2)) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:14,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {5624#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ main_~i~0 2)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) 2 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5620#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (not (<= (+ main_~i~0 1) v_main_~i~0_324)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) 1 (* 2 v_main_~i~0_322))) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:15,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {5628#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (not (<= (+ main_~i~0 1) v_main_~i~0_326)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5624#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ main_~i~0 2)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ main_~sum~0 (* 3 v_main_~i~0_320) 2 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:15,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {5632#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) main_~sum~0 (* 3 v_main_~i~0_320) 3 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_326 (+ main_~i~0 2)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5628#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (not (<= (+ main_~i~0 1) v_main_~i~0_326)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:15,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {5636#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_328 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (not (<= (+ main_~i~0 1) v_main_~i~0_328)) (< v_main_~i~0_326 (+ 2 v_main_~i~0_328)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) (* 2 v_main_~i~0_328) main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 3 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5632#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) main_~sum~0 (* 3 v_main_~i~0_320) 3 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_326 (+ main_~i~0 2)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:15,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {5640#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_328 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (< v_main_~i~0_328 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) (* 2 v_main_~i~0_328) main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (< v_main_~i~0_326 (+ 2 v_main_~i~0_328)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5636#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_328 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (not (<= (+ main_~i~0 1) v_main_~i~0_328)) (< v_main_~i~0_326 (+ 2 v_main_~i~0_328)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) (* 2 v_main_~i~0_328) main_~sum~0 (* 3 v_main_~i~0_320) main_~i~0 3 (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322)))))} is VALID [2022-04-28 10:43:15,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5640#(forall ((v_main_~i~0_322 Int) (aux_mod_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_320 Int) (aux_div_aux_div_v_main_~sum~0_338_51_70 Int) (v_main_~i~0_328 Int) (v_main_~i~0_326 Int) (v_main_~i~0_324 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_338_51_70) (<= aux_div_aux_div_v_main_~sum~0_338_51_70 (+ 5 v_main_~i~0_320)) (< v_main_~i~0_324 (+ 2 v_main_~i~0_326)) (< v_main_~i~0_328 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (+ (* 2 v_main_~i~0_326) (* 2 v_main_~i~0_328) main_~sum~0 (* 3 v_main_~i~0_320) (* aux_div_aux_div_v_main_~sum~0_338_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_324) (* 2 v_main_~i~0_322))) (< v_main_~i~0_322 (+ 2 v_main_~i~0_324)) (< v_main_~i~0_326 (+ 2 v_main_~i~0_328)) (>= aux_mod_aux_div_v_main_~sum~0_338_51_70 2) (< v_main_~i~0_320 (+ 2 v_main_~i~0_322))))} is VALID [2022-04-28 10:43:15,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-28 10:43:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:15,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015525536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:15,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:15,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 60 [2022-04-28 10:43:15,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:15,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55207628] [2022-04-28 10:43:15,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55207628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:15,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:15,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:43:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684412888] [2022-04-28 10:43:15,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:43:15,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:15,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:15,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:15,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:43:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:43:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2808, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:43:15,570 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,147 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 10:43:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:43:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:43:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-04-28 10:43:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-04-28 10:43:17,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 36 transitions. [2022-04-28 10:43:17,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:17,180 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:43:17,181 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 10:43:17,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=832, Invalid=5488, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:43:17,182 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:17,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 113 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:43:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 10:43:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 10:43:17,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:17,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,263 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,263 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,263 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:43:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:43:17,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:17,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:17,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:43:17,264 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 10:43:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,264 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 10:43:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:43:17,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:17,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:17,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:17,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 10:43:17,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 10:43:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:17,265 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 10:43:17,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:17,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 10:43:17,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 10:43:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:43:17,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:17,303 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:17,319 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-28 10:43:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:43:17,503 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 287966296, now seen corresponding path program 35 times [2022-04-28 10:43:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051967252] [2022-04-28 10:43:17,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:17,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash 287966296, now seen corresponding path program 36 times [2022-04-28 10:43:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:17,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318927270] [2022-04-28 10:43:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:17,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-28 10:43:17,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-28 10:43:17,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} call ULTIMATE.init(); {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:17,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} call #t~ret5 := main(); {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5900#true} is VALID [2022-04-28 10:43:17,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5905#(<= 0 (+ main_~sum~0 (* main_~i~0 18)))} is VALID [2022-04-28 10:43:17,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(<= 0 (+ main_~sum~0 (* main_~i~0 18)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5906#(<= 17 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-28 10:43:17,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(<= 17 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5907#(<= 33 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:43:17,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(<= 33 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5908#(<= 48 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:43:17,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {5908#(<= 48 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5909#(<= 62 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:43:17,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {5909#(<= 62 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5910#(<= 75 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:43:17,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(<= 75 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5911#(<= 87 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:43:17,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {5911#(<= 87 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5912#(<= 98 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:43:17,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {5912#(<= 98 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5913#(<= 108 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:43:17,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {5913#(<= 108 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5914#(<= 117 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:43:17,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {5914#(<= 117 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5915#(<= 125 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:43:17,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {5915#(<= 125 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5916#(<= 132 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:43:17,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {5916#(<= 132 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5917#(<= 138 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:43:17,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {5917#(<= 138 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5918#(<= 143 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:43:17,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {5918#(<= 143 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5919#(<= 147 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:43:17,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {5919#(<= 147 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5920#(<= 150 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:43:17,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {5920#(<= 150 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5921#(<= 152 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:43:17,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {5921#(<= 152 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5922#(<= 153 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:43:17,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {5922#(<= 153 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(<= 153 main_~sum~0)} is VALID [2022-04-28 10:43:17,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {5923#(<= 153 main_~sum~0)} assume !(~i~0 < ~n~0); {5923#(<= 153 main_~sum~0)} is VALID [2022-04-28 10:43:17,852 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#(<= 153 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:17,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {5924#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5925#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:17,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {5925#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5901#false} is VALID [2022-04-28 10:43:17,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {5901#false} assume !false; {5901#false} is VALID [2022-04-28 10:43:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318927270] [2022-04-28 10:43:17,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318927270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:17,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336964648] [2022-04-28 10:43:17,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:43:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:17,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:17,855 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:43:17,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 10:43:17,899 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:43:17,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:17,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:43:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:17,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:18,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} call ULTIMATE.init(); {5900#true} is VALID [2022-04-28 10:43:18,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-28 10:43:18,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-28 10:43:18,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-28 10:43:18,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} call #t~ret5 := main(); {5900#true} is VALID [2022-04-28 10:43:18,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5900#true} is VALID [2022-04-28 10:43:18,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5948#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:43:18,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5952#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:43:18,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {5952#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5956#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:43:18,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5960#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:43:18,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {5960#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5964#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:43:18,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {5964#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5968#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:43:18,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {5968#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5972#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:43:18,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {5972#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5976#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:43:18,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5980#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:43:18,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {5980#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5984#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:43:18,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {5984#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5988#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:43:18,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {5988#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5992#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:43:18,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {5992#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5996#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:43:18,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {5996#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6000#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:43:18,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {6000#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6004#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:43:18,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {6004#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6008#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:43:18,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {6008#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6012#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-28 10:43:18,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {6012#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6016#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} is VALID [2022-04-28 10:43:18,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {6016#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(<= 153 main_~sum~0)} is VALID [2022-04-28 10:43:18,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {5923#(<= 153 main_~sum~0)} assume !(~i~0 < ~n~0); {5923#(<= 153 main_~sum~0)} is VALID [2022-04-28 10:43:18,957 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#(<= 153 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:18,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:18,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {6030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5901#false} is VALID [2022-04-28 10:43:18,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {5901#false} assume !false; {5901#false} is VALID [2022-04-28 10:43:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:18,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:34,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {5901#false} assume !false; {5901#false} is VALID [2022-04-28 10:43:34,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {6030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5901#false} is VALID [2022-04-28 10:43:34,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:34,929 INFO L272 TraceCheckUtils]: 26: Hoare triple {6046#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:34,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {6046#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {6046#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:43:34,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {6053#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6046#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:43:34,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {6057#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6053#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:43:34,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {6061#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6057#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:43:34,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {6065#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6061#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:43:34,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {6069#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6065#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:43:34,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {6073#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6069#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:43:34,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {6077#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6073#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:43:34,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {6081#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_356))) (not (<= (+ main_~i~0 1) v_main_~i~0_356))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6077#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:43:34,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {6085#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 (* main_~i~0 2) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (< v_main_~i~0_356 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6081#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_356))) (not (<= (+ main_~i~0 1) v_main_~i~0_356))))} is VALID [2022-04-28 10:43:34,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {6089#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356))) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6085#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 (* main_~i~0 2) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (< v_main_~i~0_356 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70)))} is VALID [2022-04-28 10:43:34,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {6093#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356) 1)) (< v_main_~i~0_358 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6089#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356))) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:34,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {6097#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356) 1)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (not (<= (+ main_~i~0 1) v_main_~i~0_360)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6093#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) main_~sum~0 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356) 1)) (< v_main_~i~0_358 (+ main_~i~0 2))))} is VALID [2022-04-28 10:43:34,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {6101#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_360) main_~sum~0 2 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356))) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_360 (+ main_~i~0 2)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6097#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356) 1)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (not (<= (+ main_~i~0 1) v_main_~i~0_360)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:34,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {6105#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_362)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6101#(forall ((v_main_~i~0_356 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_360) main_~sum~0 2 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356))) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_360 (+ main_~i~0 2)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:34,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {6109#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 3 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (< v_main_~i~0_362 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6105#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_362)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356)))))} is VALID [2022-04-28 10:43:35,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {6113#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (not (<= (+ main_~i~0 1) v_main_~i~0_364)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6109#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 3 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358)) (< v_main_~i~0_362 (+ main_~i~0 2))))} is VALID [2022-04-28 10:43:35,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {6117#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356) 4)) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_364 (+ main_~i~0 2)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6113#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_358) (* 3 v_main_~i~0_356))) (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (not (<= (+ main_~i~0 1) v_main_~i~0_364)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:36,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {6121#(forall ((v_main_~i~0_366 Int) (v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (< v_main_~i~0_364 (+ 2 v_main_~i~0_366)) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 2 v_main_~i~0_366) (* 3 v_main_~i~0_356) 4)) (not (<= (+ main_~i~0 1) v_main_~i~0_366)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6117#(forall ((v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 (* 2 v_main_~i~0_358) (* main_~i~0 2) (* 3 v_main_~i~0_356) 4)) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (< v_main_~i~0_364 (+ main_~i~0 2)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:36,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6121#(forall ((v_main_~i~0_366 Int) (v_main_~i~0_356 Int) (v_main_~i~0_364 Int) (v_main_~i~0_362 Int) (aux_mod_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_360 Int) (aux_div_aux_div_v_main_~sum~0_375_51_70 Int) (v_main_~i~0_358 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (< v_main_~i~0_364 (+ 2 v_main_~i~0_366)) (<= aux_div_aux_div_v_main_~sum~0_375_51_70 (+ 5 v_main_~i~0_356)) (> 0 aux_mod_aux_div_v_main_~sum~0_375_51_70) (< v_main_~i~0_362 (+ 2 v_main_~i~0_364)) (< v_main_~i~0_358 (+ 2 v_main_~i~0_360)) (<= (* aux_mod_aux_div_v_main_~sum~0_375_51_70 2) (+ (* 2 v_main_~i~0_364) (* aux_div_aux_div_v_main_~sum~0_375_51_70 4) (* 2 v_main_~i~0_362) (* 2 v_main_~i~0_360) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_358) (* 2 v_main_~i~0_366) (* 3 v_main_~i~0_356) 4)) (not (<= (+ main_~i~0 1) v_main_~i~0_366)) (< v_main_~i~0_360 (+ 2 v_main_~i~0_362)) (< v_main_~i~0_356 (+ 2 v_main_~i~0_358))))} is VALID [2022-04-28 10:43:36,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5900#true} is VALID [2022-04-28 10:43:36,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} call #t~ret5 := main(); {5900#true} is VALID [2022-04-28 10:43:36,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-28 10:43:36,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-28 10:43:36,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-28 10:43:36,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} call ULTIMATE.init(); {5900#true} is VALID [2022-04-28 10:43:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:36,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336964648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:36,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:43:36,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 63 [2022-04-28 10:43:36,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:36,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051967252] [2022-04-28 10:43:36,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051967252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:36,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:36,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:43:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929188691] [2022-04-28 10:43:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:43:36,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:36,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:36,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:36,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:43:36,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:36,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:43:36,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3096, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:43:36,508 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:38,103 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 10:43:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:43:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:43:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2022-04-28 10:43:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2022-04-28 10:43:38,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 37 transitions. [2022-04-28 10:43:38,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:38,132 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:43:38,132 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:43:38,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=915, Invalid=6057, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 10:43:38,133 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:38,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:43:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:43:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:43:38,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:38,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,216 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,216 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:38,217 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:43:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:43:38,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:38,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:38,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:43:38,217 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 10:43:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:38,218 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 10:43:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:43:38,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:38,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:38,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:38,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 10:43:38,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 10:43:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:38,219 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 10:43:38,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:43:38,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 10:43:38,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 10:43:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:43:38,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:38,259 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:38,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 10:43:38,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:38,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 372409414, now seen corresponding path program 37 times [2022-04-28 10:43:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258172070] [2022-04-28 10:43:38,463 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:38,463 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:38,463 INFO L85 PathProgramCache]: Analyzing trace with hash 372409414, now seen corresponding path program 38 times [2022-04-28 10:43:38,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:38,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025210400] [2022-04-28 10:43:38,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:38,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:43:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:38,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {6416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6389#true} is VALID [2022-04-28 10:43:38,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {6389#true} assume true; {6389#true} is VALID [2022-04-28 10:43:38,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6389#true} {6389#true} #45#return; {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {6389#true} call ULTIMATE.init(); {6416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:43:38,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {6416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {6389#true} assume true; {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6389#true} {6389#true} #45#return; {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {6389#true} call #t~ret5 := main(); {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {6389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6389#true} is VALID [2022-04-28 10:43:38,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {6389#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6394#(<= 0 (+ main_~sum~0 (* 19 main_~i~0)))} is VALID [2022-04-28 10:43:38,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {6394#(<= 0 (+ main_~sum~0 (* 19 main_~i~0)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6395#(<= 18 (+ main_~sum~0 (* main_~i~0 18)))} is VALID [2022-04-28 10:43:38,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {6395#(<= 18 (+ main_~sum~0 (* main_~i~0 18)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6396#(<= 35 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-28 10:43:38,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {6396#(<= 35 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6397#(<= 51 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:43:38,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {6397#(<= 51 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6398#(<= 66 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:43:38,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {6398#(<= 66 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6399#(<= 80 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:43:38,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {6399#(<= 80 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6400#(<= 93 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:43:38,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {6400#(<= 93 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6401#(<= 105 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:43:38,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {6401#(<= 105 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6402#(<= 116 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:43:38,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {6402#(<= 116 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6403#(<= 126 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:43:38,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {6403#(<= 126 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6404#(<= 135 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:43:38,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {6404#(<= 135 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6405#(<= 143 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:43:38,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {6405#(<= 143 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6406#(<= 150 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:43:38,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {6406#(<= 150 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6407#(<= 156 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:43:38,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {6407#(<= 156 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6408#(<= 161 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:43:38,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {6408#(<= 161 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6409#(<= 165 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:43:38,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#(<= 165 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6410#(<= 168 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:43:38,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {6410#(<= 168 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6411#(<= 170 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:43:38,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {6411#(<= 170 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6412#(<= 171 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:43:38,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {6412#(<= 171 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6413#(<= 171 main_~sum~0)} is VALID [2022-04-28 10:43:38,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {6413#(<= 171 main_~sum~0)} assume !(~i~0 < ~n~0); {6413#(<= 171 main_~sum~0)} is VALID [2022-04-28 10:43:38,841 INFO L272 TraceCheckUtils]: 27: Hoare triple {6413#(<= 171 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:38,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {6414#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6415#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:38,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {6415#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6390#false} is VALID [2022-04-28 10:43:38,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {6390#false} assume !false; {6390#false} is VALID [2022-04-28 10:43:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025210400] [2022-04-28 10:43:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025210400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:43:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034881309] [2022-04-28 10:43:38,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:38,844 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:43:38,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 10:43:38,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:38,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:38,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:43:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:38,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:39,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {6389#true} call ULTIMATE.init(); {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {6389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {6389#true} assume true; {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6389#true} {6389#true} #45#return; {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {6389#true} call #t~ret5 := main(); {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {6389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6389#true} is VALID [2022-04-28 10:43:39,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {6389#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6438#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:43:39,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {6438#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6442#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:43:39,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {6442#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6446#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:43:39,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {6446#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6450#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:43:39,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {6450#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6454#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:43:39,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {6454#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6458#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:43:39,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {6458#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6462#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:43:39,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {6462#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6466#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:43:39,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {6466#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6470#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:43:39,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {6470#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6474#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:43:39,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {6474#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6478#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:43:39,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {6478#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6482#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:43:39,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {6482#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6486#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:43:39,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {6486#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6490#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:43:39,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {6490#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6494#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:43:39,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {6494#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6498#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:43:39,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {6498#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6502#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-28 10:43:39,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {6502#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6506#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} is VALID [2022-04-28 10:43:39,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {6506#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6510#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} is VALID [2022-04-28 10:43:39,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {6510#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6413#(<= 171 main_~sum~0)} is VALID [2022-04-28 10:43:39,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6413#(<= 171 main_~sum~0)} assume !(~i~0 < ~n~0); {6413#(<= 171 main_~sum~0)} is VALID [2022-04-28 10:43:39,981 INFO L272 TraceCheckUtils]: 27: Hoare triple {6413#(<= 171 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:39,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {6520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:39,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {6524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6390#false} is VALID [2022-04-28 10:43:39,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {6390#false} assume !false; {6390#false} is VALID [2022-04-28 10:43:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 171 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:43:39,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:07,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {6390#false} assume !false; {6390#false} is VALID [2022-04-28 10:44:07,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {6524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6390#false} is VALID [2022-04-28 10:44:07,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {6520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:07,790 INFO L272 TraceCheckUtils]: 27: Hoare triple {6540#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:07,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {6540#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {6540#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:44:07,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {6547#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6540#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:44:07,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {6551#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6547#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:44:07,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {6555#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6551#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:44:07,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {6559#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6555#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:44:07,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {6563#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6559#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:44:07,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {6567#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6563#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:44:07,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {6571#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6567#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:44:07,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {6575#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_394)) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) 1) (+ (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6571#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:44:07,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {6579#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_394 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6575#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_394)) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) 1) (+ (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2)))} is VALID [2022-04-28 10:44:07,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {6583#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_396)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6579#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_394 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2)))} is VALID [2022-04-28 10:44:07,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {6587#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396) 1)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396)) (< v_main_~i~0_396 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_396)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {6591#(forall ((v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_398)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396) 1)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6587#(forall ((aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 3 v_main_~i~0_394) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396) 1)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396)) (< v_main_~i~0_396 (+ main_~i~0 2))))} is VALID [2022-04-28 10:44:07,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {6595#(forall ((v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_398 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) main_~sum~0 2 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6591#(forall ((v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_398)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396) 1)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {6599#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_400)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6595#(forall ((v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_398 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) main_~sum~0 2 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {6603#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 3 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6599#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_400)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {6607#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (not (<= (+ main_~i~0 1) v_main_~i~0_402)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6603#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 3 (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {6611#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_402 (+ main_~i~0 2)) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_396))) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6607#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* 2 v_main_~i~0_396))) (not (<= (+ main_~i~0 1) v_main_~i~0_402)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:07,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {6615#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_404 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) (* 2 v_main_~i~0_404) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) 4 (* 2 v_main_~i~0_396))) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_404)) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (< v_main_~i~0_402 (+ 2 v_main_~i~0_404)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6611#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_402 (+ main_~i~0 2)) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) main_~sum~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_396))) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:17,853 WARN L290 TraceCheckUtils]: 7: Hoare triple {6619#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_404 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_404 (+ main_~i~0 2)) (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) 5 (* 2 v_main_~i~0_404) main_~sum~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (< v_main_~i~0_402 (+ 2 v_main_~i~0_404)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6615#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_404 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) (* 2 v_main_~i~0_404) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) 4 (* 2 v_main_~i~0_396))) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_404)) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (< v_main_~i~0_402 (+ 2 v_main_~i~0_404)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is UNKNOWN [2022-04-28 10:44:18,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {6389#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6619#(forall ((v_main_~i~0_400 Int) (v_main_~i~0_398 Int) (aux_div_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_396 Int) (v_main_~i~0_394 Int) (aux_mod_aux_div_v_main_~sum~0_414_51_70 Int) (v_main_~i~0_404 Int) (v_main_~i~0_402 Int)) (or (< v_main_~i~0_404 (+ main_~i~0 2)) (< v_main_~i~0_398 (+ 2 v_main_~i~0_400)) (<= aux_div_aux_div_v_main_~sum~0_414_51_70 (+ 5 v_main_~i~0_394)) (> 0 aux_mod_aux_div_v_main_~sum~0_414_51_70) (< v_main_~i~0_400 (+ 2 v_main_~i~0_402)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_414_51_70) (+ (* 2 v_main_~i~0_398) (* 3 v_main_~i~0_394) (* 2 v_main_~i~0_400) 5 (* 2 v_main_~i~0_404) main_~sum~0 (* 2 v_main_~i~0_402) (* aux_div_aux_div_v_main_~sum~0_414_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_396))) (< v_main_~i~0_402 (+ 2 v_main_~i~0_404)) (< v_main_~i~0_396 (+ 2 v_main_~i~0_398)) (>= aux_mod_aux_div_v_main_~sum~0_414_51_70 2) (< v_main_~i~0_394 (+ 2 v_main_~i~0_396))))} is VALID [2022-04-28 10:44:18,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {6389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6389#true} is VALID [2022-04-28 10:44:18,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {6389#true} call #t~ret5 := main(); {6389#true} is VALID [2022-04-28 10:44:18,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6389#true} {6389#true} #45#return; {6389#true} is VALID [2022-04-28 10:44:18,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {6389#true} assume true; {6389#true} is VALID [2022-04-28 10:44:18,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {6389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6389#true} is VALID [2022-04-28 10:44:18,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {6389#true} call ULTIMATE.init(); {6389#true} is VALID [2022-04-28 10:44:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034881309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:18,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:44:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 66 [2022-04-28 10:44:18,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:18,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258172070] [2022-04-28 10:44:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258172070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:44:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426720243] [2022-04-28 10:44:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:44:18,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:18,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:18,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:44:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:44:18,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=3397, Unknown=1, NotChecked=0, Total=4290 [2022-04-28 10:44:18,205 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:20,073 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 10:44:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:44:20,073 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:44:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:44:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2022-04-28 10:44:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2022-04-28 10:44:20,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 38 transitions. [2022-04-28 10:44:20,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:20,101 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:44:20,101 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:44:20,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1002, Invalid=6653, Unknown=1, NotChecked=0, Total=7656 [2022-04-28 10:44:20,102 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:44:20,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:44:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:44:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 10:44:20,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:44:20,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,200 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,200 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:20,200 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:44:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:44:20,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:20,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:20,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:44:20,201 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:44:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:44:20,201 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 10:44:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:44:20,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:44:20,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:44:20,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:44:20,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:44:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 10:44:20,202 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 10:44:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:44:20,202 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 10:44:20,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:44:20,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 10:44:20,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 10:44:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:44:20,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:44:20,241 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:44:20,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 10:44:20,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:20,442 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:44:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:44:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1304821224, now seen corresponding path program 39 times [2022-04-28 10:44:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:20,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571298313] [2022-04-28 10:44:20,445 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:44:20,445 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:44:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1304821224, now seen corresponding path program 40 times [2022-04-28 10:44:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:44:20,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941401981] [2022-04-28 10:44:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:44:20,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:44:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:44:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:20,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {6923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6895#true} is VALID [2022-04-28 10:44:20,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {6895#true} assume true; {6895#true} is VALID [2022-04-28 10:44:20,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6895#true} {6895#true} #45#return; {6895#true} is VALID [2022-04-28 10:44:20,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {6895#true} call ULTIMATE.init(); {6923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:44:20,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {6923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6895#true} is VALID [2022-04-28 10:44:20,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {6895#true} assume true; {6895#true} is VALID [2022-04-28 10:44:20,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6895#true} {6895#true} #45#return; {6895#true} is VALID [2022-04-28 10:44:20,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {6895#true} call #t~ret5 := main(); {6895#true} is VALID [2022-04-28 10:44:20,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {6895#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6895#true} is VALID [2022-04-28 10:44:20,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {6895#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6900#(<= 0 (+ main_~sum~0 (* main_~i~0 20)))} is VALID [2022-04-28 10:44:20,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {6900#(<= 0 (+ main_~sum~0 (* main_~i~0 20)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6901#(<= 19 (+ main_~sum~0 (* 19 main_~i~0)))} is VALID [2022-04-28 10:44:20,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {6901#(<= 19 (+ main_~sum~0 (* 19 main_~i~0)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6902#(<= 37 (+ main_~sum~0 (* main_~i~0 18)))} is VALID [2022-04-28 10:44:20,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {6902#(<= 37 (+ main_~sum~0 (* main_~i~0 18)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6903#(<= 54 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-28 10:44:20,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {6903#(<= 54 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6904#(<= 70 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:44:20,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {6904#(<= 70 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6905#(<= 85 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:44:20,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {6905#(<= 85 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6906#(<= 99 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:44:20,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {6906#(<= 99 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6907#(<= 112 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:44:20,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {6907#(<= 112 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6908#(<= 124 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:44:20,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {6908#(<= 124 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6909#(<= 135 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:44:20,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {6909#(<= 135 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6910#(<= 145 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:44:20,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {6910#(<= 145 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6911#(<= 154 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:44:20,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {6911#(<= 154 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6912#(<= 162 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:44:20,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {6912#(<= 162 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6913#(<= 169 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:44:20,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {6913#(<= 169 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6914#(<= 175 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:44:20,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {6914#(<= 175 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6915#(<= 180 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:44:20,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {6915#(<= 180 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6916#(<= 184 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:44:20,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {6916#(<= 184 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6917#(<= 187 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:44:20,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {6917#(<= 187 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6918#(<= 189 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:44:20,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {6918#(<= 189 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6919#(<= 190 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:44:20,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {6919#(<= 190 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6920#(<= 190 main_~sum~0)} is VALID [2022-04-28 10:44:20,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {6920#(<= 190 main_~sum~0)} assume !(~i~0 < ~n~0); {6920#(<= 190 main_~sum~0)} is VALID [2022-04-28 10:44:20,856 INFO L272 TraceCheckUtils]: 28: Hoare triple {6920#(<= 190 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:20,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {6921#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6922#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:44:20,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {6922#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6896#false} is VALID [2022-04-28 10:44:20,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {6896#false} assume !false; {6896#false} is VALID [2022-04-28 10:44:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941401981] [2022-04-28 10:44:20,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941401981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:44:20,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613721912] [2022-04-28 10:44:20,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:44:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:44:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:44:20,859 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:44:20,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 10:44:20,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:44:20,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:44:20,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:44:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:44:20,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:44:22,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {6895#true} call ULTIMATE.init(); {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {6895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {6895#true} assume true; {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6895#true} {6895#true} #45#return; {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {6895#true} call #t~ret5 := main(); {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {6895#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6895#true} is VALID [2022-04-28 10:44:22,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {6895#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {6945#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:44:22,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {6945#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6949#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:44:22,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {6949#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6953#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:44:22,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {6953#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6957#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:44:22,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {6957#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6961#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:44:22,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {6961#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6965#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:44:22,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {6965#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6969#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:44:22,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6969#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6973#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:44:22,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {6973#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6977#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:44:22,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {6977#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6981#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:44:22,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6985#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:44:22,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {6985#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6989#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:44:22,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {6989#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6993#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:44:22,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {6993#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6997#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:44:22,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {6997#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7001#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:44:22,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {7001#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7005#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:44:22,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {7005#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7009#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-28 10:44:22,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {7009#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7013#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} is VALID [2022-04-28 10:44:22,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {7013#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7017#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} is VALID [2022-04-28 10:44:22,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {7017#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7021#(and (<= 19 main_~i~0) (<= 171 main_~sum~0))} is VALID [2022-04-28 10:44:22,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {7021#(and (<= 19 main_~i~0) (<= 171 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6920#(<= 190 main_~sum~0)} is VALID [2022-04-28 10:44:22,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {6920#(<= 190 main_~sum~0)} assume !(~i~0 < ~n~0); {6920#(<= 190 main_~sum~0)} is VALID [2022-04-28 10:44:22,147 INFO L272 TraceCheckUtils]: 28: Hoare triple {6920#(<= 190 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {7031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:22,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:22,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6896#false} is VALID [2022-04-28 10:44:22,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {6896#false} assume !false; {6896#false} is VALID [2022-04-28 10:44:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 190 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:44:22,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:45:02,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {6896#false} assume !false; {6896#false} is VALID [2022-04-28 10:45:02,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6896#false} is VALID [2022-04-28 10:45:02,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:45:02,446 INFO L272 TraceCheckUtils]: 28: Hoare triple {7051#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {7031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:45:02,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {7051#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {7051#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:45:02,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {7058#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7051#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:45:02,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {7062#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7058#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:45:02,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {7066#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7062#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:45:02,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {7070#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7066#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:45:02,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {7074#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7070#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:45:02,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {7078#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7074#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:45:02,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {7082#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:45:02,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {7086#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) 1) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434))) (not (<= (+ main_~i~0 1) v_main_~i~0_434)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7082#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:45:02,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {7090#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 3 v_main_~i~0_434) (* main_~i~0 2))) (< v_main_~i~0_434 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7086#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) 1) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434))) (not (<= (+ main_~i~0 1) v_main_~i~0_434)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is VALID [2022-04-28 10:45:02,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {7094#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (not (<= (+ main_~i~0 1) v_main_~i~0_436)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7090#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 3 v_main_~i~0_434) (* main_~i~0 2))) (< v_main_~i~0_434 (+ main_~i~0 2))))} is VALID [2022-04-28 10:45:02,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {7098#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 3 v_main_~i~0_434) (* main_~i~0 2) 1)) (< v_main_~i~0_436 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7094#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (not (<= (+ main_~i~0 1) v_main_~i~0_436)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434)))))} is VALID [2022-04-28 10:45:02,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_438))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7098#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 3 v_main_~i~0_434) (* main_~i~0 2) 1)) (< v_main_~i~0_436 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is VALID [2022-04-28 10:45:02,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {7106#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (< v_main_~i~0_438 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) 2 (* 3 v_main_~i~0_434) (* main_~i~0 2)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7102#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 (* 3 v_main_~i~0_434) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_438))))} is VALID [2022-04-28 10:45:04,734 WARN L290 TraceCheckUtils]: 13: Hoare triple {7110#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_440)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 2 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_440))) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7106#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (< v_main_~i~0_438 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) 2 (* 3 v_main_~i~0_434) (* main_~i~0 2)))))} is UNKNOWN [2022-04-28 10:45:06,764 WARN L290 TraceCheckUtils]: 12: Hoare triple {7114#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (< v_main_~i~0_440 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) 3 (* 3 v_main_~i~0_434) (* main_~i~0 2) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7110#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_440)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) main_~i~0 2 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_440))) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is UNKNOWN [2022-04-28 10:45:07,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {7118#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 3 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_442))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7114#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (< v_main_~i~0_440 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) 3 (* 3 v_main_~i~0_434) (* main_~i~0 2) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is VALID [2022-04-28 10:45:09,279 WARN L290 TraceCheckUtils]: 10: Hoare triple {7122#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ main_~i~0 2)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) (* 3 v_main_~i~0_434) (* main_~i~0 2) 4 (* 2 v_main_~i~0_440))) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7118#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 3 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_442))))} is UNKNOWN [2022-04-28 10:45:20,226 WARN L290 TraceCheckUtils]: 9: Hoare triple {7126#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (not (<= (+ main_~i~0 1) v_main_~i~0_444)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_444) 4 (* 2 v_main_~i~0_440))) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7122#(forall ((aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ main_~i~0 2)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) (* 3 v_main_~i~0_434) (* main_~i~0 2) 4 (* 2 v_main_~i~0_440))) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is UNKNOWN [2022-04-28 10:45:31,495 WARN L290 TraceCheckUtils]: 8: Hoare triple {7130#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_444 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) 5 (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) (* 3 v_main_~i~0_434) (* main_~i~0 2) (* 2 v_main_~i~0_444) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7126#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (not (<= (+ main_~i~0 1) v_main_~i~0_444)) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_444) 4 (* 2 v_main_~i~0_440))) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is UNKNOWN [2022-04-28 10:45:41,955 WARN L290 TraceCheckUtils]: 7: Hoare triple {7134#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int) (v_main_~i~0_446 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (< v_main_~i~0_444 (+ 2 v_main_~i~0_446)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) 5 (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 (* 2 v_main_~i~0_446) (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_444) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_446))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7130#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (< v_main_~i~0_444 (+ main_~i~0 2)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) 5 (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) (* 3 v_main_~i~0_434) (* main_~i~0 2) (* 2 v_main_~i~0_444) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70)))} is UNKNOWN [2022-04-28 10:45:42,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {6895#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {7134#(forall ((v_main_~i~0_444 Int) (aux_mod_aux_div_v_main_~sum~0_455_51_70 Int) (aux_div_aux_div_v_main_~sum~0_455_51_70 Int) (v_main_~i~0_442 Int) (v_main_~i~0_440 Int) (v_main_~i~0_438 Int) (v_main_~i~0_436 Int) (v_main_~i~0_434 Int) (v_main_~i~0_446 Int)) (or (< v_main_~i~0_442 (+ 2 v_main_~i~0_444)) (< v_main_~i~0_438 (+ 2 v_main_~i~0_440)) (< v_main_~i~0_444 (+ 2 v_main_~i~0_446)) (>= aux_mod_aux_div_v_main_~sum~0_455_51_70 2) (< v_main_~i~0_434 (+ 2 v_main_~i~0_436)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_455_51_70) (+ (* 2 v_main_~i~0_438) 5 (* 2 v_main_~i~0_436) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_455_51_70 4) (* 2 v_main_~i~0_442) main_~i~0 (* 2 v_main_~i~0_446) (* 3 v_main_~i~0_434) (* 2 v_main_~i~0_444) (* 2 v_main_~i~0_440))) (< v_main_~i~0_436 (+ 2 v_main_~i~0_438)) (<= aux_div_aux_div_v_main_~sum~0_455_51_70 (+ 5 v_main_~i~0_434)) (< v_main_~i~0_440 (+ 2 v_main_~i~0_442)) (> 0 aux_mod_aux_div_v_main_~sum~0_455_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_446))))} is VALID [2022-04-28 10:45:42,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {6895#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {6895#true} is VALID [2022-04-28 10:45:42,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {6895#true} call #t~ret5 := main(); {6895#true} is VALID [2022-04-28 10:45:42,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6895#true} {6895#true} #45#return; {6895#true} is VALID [2022-04-28 10:45:42,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {6895#true} assume true; {6895#true} is VALID [2022-04-28 10:45:42,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {6895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {6895#true} is VALID [2022-04-28 10:45:42,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {6895#true} call ULTIMATE.init(); {6895#true} is VALID [2022-04-28 10:45:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613721912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:45:42,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:45:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 69 [2022-04-28 10:45:42,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:45:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571298313] [2022-04-28 10:45:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571298313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:45:42,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:45:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:45:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544822828] [2022-04-28 10:45:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:45:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:45:42,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:45:42,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:42,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:42,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:45:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:45:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=978, Invalid=3710, Unknown=4, NotChecked=0, Total=4692 [2022-04-28 10:45:42,304 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:44,581 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 10:45:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:45:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:45:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2022-04-28 10:45:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2022-04-28 10:45:44,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 39 transitions. [2022-04-28 10:45:44,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:44,612 INFO L225 Difference]: With dead ends: 39 [2022-04-28 10:45:44,612 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:45:44,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1093, Invalid=7275, Unknown=4, NotChecked=0, Total=8372 [2022-04-28 10:45:44,614 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:44,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:45:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:45:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 10:45:44,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:44,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,740 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,740 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:44,740 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:45:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:45:44,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:44,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:44,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:45:44,741 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 10:45:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:44,741 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 10:45:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:45:44,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:44,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:44,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:44,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 10:45:44,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 10:45:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:44,743 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 10:45:44,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:45:44,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 10:45:44,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 10:45:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:45:44,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:44,802 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:44,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 10:45:45,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 10:45:45,003 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1759363450, now seen corresponding path program 41 times [2022-04-28 10:45:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:45,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363455990] [2022-04-28 10:45:45,006 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:45:45,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:45:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1759363450, now seen corresponding path program 42 times [2022-04-28 10:45:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:45,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589768529] [2022-04-28 10:45:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:45:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:45,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {7447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {7418#true} is VALID [2022-04-28 10:45:45,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {7418#true} assume true; {7418#true} is VALID [2022-04-28 10:45:45,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7418#true} {7418#true} #45#return; {7418#true} is VALID [2022-04-28 10:45:45,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {7418#true} call ULTIMATE.init(); {7447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:45:45,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {7447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {7418#true} is VALID [2022-04-28 10:45:45,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {7418#true} assume true; {7418#true} is VALID [2022-04-28 10:45:45,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7418#true} {7418#true} #45#return; {7418#true} is VALID [2022-04-28 10:45:45,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {7418#true} call #t~ret5 := main(); {7418#true} is VALID [2022-04-28 10:45:45,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {7418#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {7418#true} is VALID [2022-04-28 10:45:45,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {7418#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {7423#(<= 0 (+ main_~sum~0 (* main_~i~0 21)))} is VALID [2022-04-28 10:45:45,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {7423#(<= 0 (+ main_~sum~0 (* main_~i~0 21)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7424#(<= 20 (+ main_~sum~0 (* main_~i~0 20)))} is VALID [2022-04-28 10:45:45,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {7424#(<= 20 (+ main_~sum~0 (* main_~i~0 20)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7425#(<= 39 (+ main_~sum~0 (* 19 main_~i~0)))} is VALID [2022-04-28 10:45:45,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {7425#(<= 39 (+ main_~sum~0 (* 19 main_~i~0)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7426#(<= 57 (+ main_~sum~0 (* main_~i~0 18)))} is VALID [2022-04-28 10:45:45,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {7426#(<= 57 (+ main_~sum~0 (* main_~i~0 18)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7427#(<= 74 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-28 10:45:45,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {7427#(<= 74 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7428#(<= 90 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-28 10:45:45,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {7428#(<= 90 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7429#(<= 105 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-28 10:45:45,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {7429#(<= 105 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7430#(<= 119 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-28 10:45:45,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {7430#(<= 119 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7431#(<= 132 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-28 10:45:45,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {7431#(<= 132 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7432#(<= 144 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-28 10:45:45,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {7432#(<= 144 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7433#(<= 155 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-28 10:45:45,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {7433#(<= 155 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7434#(<= 165 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-28 10:45:45,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {7434#(<= 165 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7435#(<= 174 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-28 10:45:45,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {7435#(<= 174 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7436#(<= 182 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-28 10:45:45,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {7436#(<= 182 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7437#(<= 189 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:45:45,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {7437#(<= 189 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7438#(<= 195 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-28 10:45:45,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {7438#(<= 195 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7439#(<= 200 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-28 10:45:45,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {7439#(<= 200 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7440#(<= 204 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-28 10:45:45,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {7440#(<= 204 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7441#(<= 207 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-28 10:45:45,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {7441#(<= 207 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7442#(<= 209 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-28 10:45:45,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {7442#(<= 209 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7443#(<= 210 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:45:45,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {7443#(<= 210 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7444#(<= 210 main_~sum~0)} is VALID [2022-04-28 10:45:45,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {7444#(<= 210 main_~sum~0)} assume !(~i~0 < ~n~0); {7444#(<= 210 main_~sum~0)} is VALID [2022-04-28 10:45:45,595 INFO L272 TraceCheckUtils]: 29: Hoare triple {7444#(<= 210 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {7445#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:45:45,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {7445#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7446#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:45:45,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {7446#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7419#false} is VALID [2022-04-28 10:45:45,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {7419#false} assume !false; {7419#false} is VALID [2022-04-28 10:45:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:45:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589768529] [2022-04-28 10:45:45,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589768529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:45:45,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101400974] [2022-04-28 10:45:45,597 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:45:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:45,598 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:45:45,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 10:45:45,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:45:45,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:45:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:45:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:45,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:45:47,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {7418#true} call ULTIMATE.init(); {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {7418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {7418#true} assume true; {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7418#true} {7418#true} #45#return; {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {7418#true} call #t~ret5 := main(); {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {7418#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {7418#true} is VALID [2022-04-28 10:45:47,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {7418#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {7469#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-28 10:45:47,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {7469#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7473#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-28 10:45:47,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {7473#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7477#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-28 10:45:47,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7481#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-28 10:45:47,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {7481#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7485#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-28 10:45:47,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {7485#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7489#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-28 10:45:47,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7493#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-28 10:45:47,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {7493#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7497#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-28 10:45:47,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {7497#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7501#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-28 10:45:47,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {7501#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7505#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-28 10:45:47,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {7505#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7509#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-28 10:45:47,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {7509#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7513#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-28 10:45:47,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {7513#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7517#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-28 10:45:47,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7521#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-28 10:45:47,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {7521#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7525#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-28 10:45:47,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {7525#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7529#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-28 10:45:47,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {7529#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7533#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-28 10:45:47,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {7533#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7537#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} is VALID [2022-04-28 10:45:47,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {7537#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7541#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} is VALID [2022-04-28 10:45:47,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {7541#(and (<= 153 main_~sum~0) (<= 18 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7545#(and (<= 19 main_~i~0) (<= 171 main_~sum~0))} is VALID [2022-04-28 10:45:47,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {7545#(and (<= 19 main_~i~0) (<= 171 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7549#(and (<= 190 main_~sum~0) (<= 20 main_~i~0))} is VALID [2022-04-28 10:45:47,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {7549#(and (<= 190 main_~sum~0) (<= 20 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7444#(<= 210 main_~sum~0)} is VALID [2022-04-28 10:45:47,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {7444#(<= 210 main_~sum~0)} assume !(~i~0 < ~n~0); {7444#(<= 210 main_~sum~0)} is VALID [2022-04-28 10:45:47,280 INFO L272 TraceCheckUtils]: 29: Hoare triple {7444#(<= 210 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {7559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:45:47,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {7559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:45:47,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {7563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7419#false} is VALID [2022-04-28 10:45:47,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {7419#false} assume !false; {7419#false} is VALID [2022-04-28 10:45:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 210 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:45:47,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:17,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {7419#false} assume !false; {7419#false} is VALID [2022-04-28 10:46:17,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {7563#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7419#false} is VALID [2022-04-28 10:46:17,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {7559#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7563#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:46:17,461 INFO L272 TraceCheckUtils]: 29: Hoare triple {7579#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {7559#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:46:17,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {7579#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {7579#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:46:17,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {7586#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7579#(<= 0 main_~sum~0)} is VALID [2022-04-28 10:46:17,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {7590#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7586#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-28 10:46:17,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {7594#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7590#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-28 10:46:17,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {7598#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7594#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:46:17,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {7602#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7598#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-28 10:46:17,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {7606#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7602#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-28 10:46:17,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {7610#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7606#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-28 10:46:17,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {7614#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (not (<= (+ main_~i~0 1) v_main_~i~0_476)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) 1) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_498_51_70 4)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7610#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-28 10:46:17,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {7618#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int)) (or (< v_main_~i~0_476 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7614#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (not (<= (+ main_~i~0 1) v_main_~i~0_476)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) 1) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_498_51_70 4)))))} is VALID [2022-04-28 10:46:17,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {7622#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_478)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_478) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7618#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int)) (or (< v_main_~i~0_476 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2)))))} is VALID [2022-04-28 10:46:17,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {7626#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* 2 v_main_~i~0_478) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) 1)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7622#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_478)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_478) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4)))))} is VALID [2022-04-28 10:46:17,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {7630#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_480)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) 1)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7626#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* 2 v_main_~i~0_478) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) 1)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ main_~i~0 2))))} is VALID [2022-04-28 10:46:18,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {7634#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_480 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 2 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7630#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_480)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) 1)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is VALID [2022-04-28 10:46:18,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {7638#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_482)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* 2 v_main_~i~0_482))) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7634#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_480 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 2 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is VALID [2022-04-28 10:46:18,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {7642#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 3 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_482))) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_482 (+ main_~i~0 2)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7638#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_482)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* 2 v_main_~i~0_482))) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is VALID [2022-04-28 10:46:20,369 WARN L290 TraceCheckUtils]: 12: Hoare triple {7646#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_484 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_482 (+ 2 v_main_~i~0_484)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (not (<= (+ main_~i~0 1) v_main_~i~0_484)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* 2 v_main_~i~0_484) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* 2 v_main_~i~0_482))) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7642#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 3 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_482))) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_482 (+ main_~i~0 2)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is UNKNOWN [2022-04-28 10:46:22,451 WARN L290 TraceCheckUtils]: 11: Hoare triple {7650#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_484 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_484 (+ main_~i~0 2)) (< v_main_~i~0_482 (+ 2 v_main_~i~0_484)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* 2 v_main_~i~0_484) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_482))) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7646#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_484 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_482 (+ 2 v_main_~i~0_484)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (not (<= (+ main_~i~0 1) v_main_~i~0_484)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 3 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* 2 v_main_~i~0_484) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* 2 v_main_~i~0_482))) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is UNKNOWN [2022-04-28 10:46:22,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {7654#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_486 Int) (v_main_~i~0_484 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 2 v_main_~i~0_486) (* 3 v_main_~i~0_476) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* 2 v_main_~i~0_484) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) 4 (* 2 v_main_~i~0_482))) (< v_main_~i~0_482 (+ 2 v_main_~i~0_484)) (< v_main_~i~0_484 (+ 2 v_main_~i~0_486)) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (not (<= (+ main_~i~0 1) v_main_~i~0_486)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7650#(forall ((v_main_~i~0_476 Int) (aux_div_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_484 Int) (v_main_~i~0_482 Int) (v_main_~i~0_480 Int) (aux_mod_aux_div_v_main_~sum~0_498_51_70 Int) (v_main_~i~0_478 Int)) (or (< v_main_~i~0_484 (+ main_~i~0 2)) (< v_main_~i~0_482 (+ 2 v_main_~i~0_484)) (<= (* aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (+ (* 3 v_main_~i~0_476) main_~sum~0 (* 2 v_main_~i~0_478) (* 2 v_main_~i~0_480) (* 2 v_main_~i~0_484) (* aux_div_aux_div_v_main_~sum~0_498_51_70 4) (* main_~i~0 2) 4 (* 2 v_main_~i~0_482))) (> 0 aux_mod_aux_div_v_main_~sum~0_498_51_70) (< v_main_~i~0_480 (+ 2 v_main_~i~0_482)) (>= aux_mod_aux_div_v_main_~sum~0_498_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_498_51_70 (+ 5 v_main_~i~0_476)) (< v_main_~i~0_476 (+ 2 v_main_~i~0_478)) (< v_main_~i~0_478 (+ 2 v_main_~i~0_480))))} is VALID [2022-04-28 10:46:33,032 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-04-28 10:46:33,033 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 10:46:33,033 ERROR L245 FreeRefinementEngine]: Caught known exception: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-04-28 10:46:33,033 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 10:46:33,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-04-28 10:46:33,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 10:46:33,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 10:46:33,234 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUtils.isInductiveHelper(PredicateUtils.java:348) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInductivityAtPosition(TraceCheckUtils.java:289) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityBackward(TraceCheckUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 51 more [2022-04-28 10:46:33,238 INFO L158 Benchmark]: Toolchain (without parser) took 435184.74ms. Allocated memory was 189.8MB in the beginning and 274.7MB in the end (delta: 84.9MB). Free memory was 134.6MB in the beginning and 149.5MB in the end (delta: -14.9MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-04-28 10:46:33,238 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:46:33,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.62ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 134.4MB in the beginning and 200.6MB in the end (delta: -66.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-28 10:46:33,238 INFO L158 Benchmark]: Boogie Preprocessor took 25.07ms. Allocated memory is still 228.6MB. Free memory was 200.6MB in the beginning and 198.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:46:33,239 INFO L158 Benchmark]: RCFGBuilder took 225.60ms. Allocated memory is still 228.6MB. Free memory was 198.9MB in the beginning and 187.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:46:33,239 INFO L158 Benchmark]: TraceAbstraction took 434722.17ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 186.5MB in the beginning and 149.5MB in the end (delta: 37.0MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. [2022-04-28 10:46:33,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.62ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 134.4MB in the beginning and 200.6MB in the end (delta: -66.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.07ms. Allocated memory is still 228.6MB. Free memory was 200.6MB in the beginning and 198.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 225.60ms. Allocated memory is still 228.6MB. Free memory was 198.9MB in the beginning and 187.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 434722.17ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 186.5MB in the beginning and 149.5MB in the end (delta: 37.0MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...