/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:21:46,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:21:46,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:21:46,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:21:46,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:21:46,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:21:46,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:21:46,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:21:46,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:21:46,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:21:46,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:21:46,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:21:46,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:21:46,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:21:46,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:21:46,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:21:46,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:21:46,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:21:46,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:21:46,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:21:46,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:21:46,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:21:46,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:21:46,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:21:46,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:21:46,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:21:46,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:21:46,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:21:46,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:21:46,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:21:46,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:21:46,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:21:46,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:21:46,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:21:46,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:21:46,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:21:46,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:21:46,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:21:46,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:21:46,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:21:46,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:21:46,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:21:46,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:21:46,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:21:46,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:21:46,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:21:46,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:21:46,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:21:46,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:21:46,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:21:46,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:21:46,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:21:46,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:21:46,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:21:46,706 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:21:46,706 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:21:46,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:21:46,706 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:21:46,706 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-15 06:21:46,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:21:46,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:21:46,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:21:46,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:21:46,968 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:21:46,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-15 06:21:47,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425a5b8e9/2fe49aa3f7d041138ec7caaa09765dcf/FLAGccb80adae [2022-04-15 06:21:47,384 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:21:47,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i [2022-04-15 06:21:47,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425a5b8e9/2fe49aa3f7d041138ec7caaa09765dcf/FLAGccb80adae [2022-04-15 06:21:47,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425a5b8e9/2fe49aa3f7d041138ec7caaa09765dcf [2022-04-15 06:21:47,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:21:47,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:21:47,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:21:47,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:21:47,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:21:47,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b47aab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47, skipping insertion in model container [2022-04-15 06:21:47,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:21:47,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:21:47,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-15 06:21:47,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:21:47,597 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:21:47,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i[891,904] [2022-04-15 06:21:47,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:21:47,626 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:21:47,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47 WrapperNode [2022-04-15 06:21:47,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:21:47,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:21:47,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:21:47,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:21:47,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:21:47,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:21:47,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:21:47,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:21:47,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (1/1) ... [2022-04-15 06:21:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:21:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:47,693 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-15 06:21:47,695 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-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:21:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:21:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:21:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:21:47,781 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:21:47,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:21:47,992 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:21:47,998 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:21:47,998 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:21:48,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:21:48 BoogieIcfgContainer [2022-04-15 06:21:48,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:21:48,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:21:48,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:21:48,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:21:48,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:21:47" (1/3) ... [2022-04-15 06:21:48,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605bc908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:21:48, skipping insertion in model container [2022-04-15 06:21:48,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:47" (2/3) ... [2022-04-15 06:21:48,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605bc908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:21:48, skipping insertion in model container [2022-04-15 06:21:48,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:21:48" (3/3) ... [2022-04-15 06:21:48,007 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i [2022-04-15 06:21:48,011 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:21:48,011 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:21:48,047 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:21:48,053 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:21:48,053 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:21:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:21:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:21:48,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:48,076 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:48,076 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-15 06:21:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643240468] [2022-04-15 06:21:48,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:21:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-15 06:21:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:48,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428548843] [2022-04-15 06:21:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:48,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:21:48,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478350097] [2022-04-15 06:21:48,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:21:48,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:48,212 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-15 06:21:48,215 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-15 06:21:48,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 06:21:48,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:21:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 06:21:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:48,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:48,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-15 06:21:48,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-15 06:21:48,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:21:48,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-15 06:21:48,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-15 06:21:48,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-15 06:21:48,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} is VALID [2022-04-15 06:21:48,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(and (<= 1 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 <= ~n~0); {25#false} is VALID [2022-04-15 06:21:48,494 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {25#false} is VALID [2022-04-15 06:21:48,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:21:48,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:21:48,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:21:48,496 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-15 06:21:48,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:21:48,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428548843] [2022-04-15 06:21:48,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:21:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478350097] [2022-04-15 06:21:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478350097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:48,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:48,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:21:48,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643240468] [2022-04-15 06:21:48,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643240468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:48,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:48,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:21:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842572580] [2022-04-15 06:21:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:21:48,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:48,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,530 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-15 06:21:48,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:21:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:21:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:21:48,567 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:48,664 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 06:21:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:21:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:21:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 06:21:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-15 06:21:48,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-15 06:21:48,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:48,733 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:21:48,733 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:21:48,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:21:48,741 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:21:48,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:21:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:21:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 06:21:48,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:48,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,771 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,771 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:48,775 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:21:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:21:48,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:48,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:48,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:21:48,777 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:21:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:48,781 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:21:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:21:48,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:48,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:48,788 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-15 06:21:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 06:21:48,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 06:21:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:48,796 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 06:21:48,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:48,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 06:21:48,811 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-15 06:21:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:21:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:21:48,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:48,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:48,842 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-15 06:21:49,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 06:21:49,037 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-15 06:21:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052853775] [2022-04-15 06:22:02,440 WARN L232 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 69 DAG size of output: 59 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 06:22:02,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:22:02,460 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:22:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 562650993, now seen corresponding path program 1 times [2022-04-15 06:22:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:22:02,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40924439] [2022-04-15 06:22:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:22:02,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 06:22:02,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217725125] [2022-04-15 06:22:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:22:02,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:22:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:22:02,484 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-15 06:22:02,519 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-15 06:22:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:03,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:22:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:22:03,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:24:23,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-15 06:24:23,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {194#true} is VALID [2022-04-15 06:24:23,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 06:24:23,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-15 06:24:23,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret3 := main(); {194#true} is VALID [2022-04-15 06:24:23,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~n~0;havoc ~sum~0;havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-15 06:24:23,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(1 <= ~n~0 && ~n~0 <= 1000);~sum~0 := 0;~i~0 := 1; {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} is VALID [2022-04-15 06:24:23,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))} [59] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse1 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse2 (= v_main_~sum~0_8 v_main_~sum~0_7)) (.cse4 (* (- 1) v_main_~i~0_8)) (.cse5 (* (- 1) v_main_~i~0_7))) (or (and (not (<= v_main_~i~0_8 v_main_~n~0_10)) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= v_main_~n~0_10 v_main_~n~0_10) .cse2) (let ((.cse3 (div (+ v_main_~i~0_8 .cse5) (- 2)))) (and (= (mod (+ v_main_~i~0_8 v_main_~i~0_7) 2) 0) (<= .cse3 (+ (div (+ (- 1) v_main_~n~0_10 .cse4) 2) 1)) (< 0 .cse3) (= (+ (* 2 (* v_main_~i~0_8 .cse3)) (* (* .cse3 .cse3) 2) v_main_~sum~0_8) (+ .cse3 v_main_~sum~0_7)))) (let ((.cse6 (div (+ v_main_~i~0_8 .cse5 1) (- 2)))) (and (= (+ .cse6 v_main_~i~0_8 (* 2 (* .cse6 v_main_~i~0_8)) (* (* .cse6 .cse6) 2) v_main_~sum~0_8) v_main_~sum~0_7) (<= 0 .cse6) (<= .cse6 (div (+ v_main_~n~0_10 .cse4) 2)) (= (mod (+ v_main_~i~0_8 v_main_~i~0_7 1) 2) 0))))) InVars {main_~i~0=v_main_~i~0_8, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_10, main_~sum~0=v_main_~sum~0_8} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_10, main_~sum~0=v_main_~sum~0_7} AuxVars[] AssignedVars[main_~sum~0, main_~i~0, main_#t~post2] {221#(and (<= 1 main_~n~0) (or (and (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 2) main_~n~0) 2) 1)) (= (+ main_~sum~0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (+ (* 2 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))))) (= (mod (+ main_~i~0 1) 2) 0) (< 0 (div (+ (* (- 1) main_~i~0) 1) (- 2)))) (and (= main_~sum~0 0) (= main_~i~0 1)) (and (<= (div (+ (* (- 1) main_~i~0) 2) (- 2)) (div (+ (- 1) main_~n~0) 2)) (= 0 (mod main_~i~0 2)) (<= 0 (div (+ (* (- 1) main_~i~0) 2) (- 2))) (= main_~sum~0 (+ (* 3 (div (+ (* (- 1) main_~i~0) 2) (- 2))) (* (* (div (+ (* (- 1) main_~i~0) 2) (- 2)) (div (+ (* (- 1) main_~i~0) 2) (- 2))) 2) 1)))))} is VALID [2022-04-15 06:24:23,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(and (<= 1 main_~n~0) (or (and (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 2) main_~n~0) 2) 1)) (= (+ main_~sum~0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (+ (* 2 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))))) (= (mod (+ main_~i~0 1) 2) 0) (< 0 (div (+ (* (- 1) main_~i~0) 1) (- 2)))) (and (= main_~sum~0 0) (= main_~i~0 1)) (and (<= (div (+ (* (- 1) main_~i~0) 2) (- 2)) (div (+ (- 1) main_~n~0) 2)) (= 0 (mod main_~i~0 2)) (<= 0 (div (+ (* (- 1) main_~i~0) 2) (- 2))) (= main_~sum~0 (+ (* 3 (div (+ (* (- 1) main_~i~0) 2) (- 2))) (* (* (div (+ (* (- 1) main_~i~0) 2) (- 2)) (div (+ (* (- 1) main_~i~0) 2) (- 2))) 2) 1)))))} [58] L29-4_primed-->L29-4: Formula: (not (<= v_main_~i~0_2 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {225#(and (<= 1 main_~n~0) (or (exists ((aux_div_aux_mod_aux_mod_main_~i~0_37_67_39 Int) (aux_div_aux_mod_main_~i~0_37_67 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (= main_~sum~0 (+ (* (* (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2)) (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2))) 2) (* 3 (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2))) 1)) (<= aux_div_aux_mod_main_~i~0_37_67 (+ (div (+ (- 1) main_~n~0) 2) aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (< (+ main_~n~0 (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (+ (* 2 aux_div_aux_mod_main_~i~0_37_67) 2)))) (exists ((aux_div_main_~i~0_37 Int) (aux_div_aux_mod_main_~i~0_37_28 Int)) (and (<= aux_div_main_~i~0_37 (+ (div (+ (- 2) main_~n~0) 2) 1)) (<= 0 (* 2 aux_div_aux_mod_main_~i~0_37_28)) (< (+ (* 2 aux_div_aux_mod_main_~i~0_37_28) main_~n~0) (+ (* 2 aux_div_main_~i~0_37) 1)) (= (+ (* (* aux_div_main_~i~0_37 aux_div_main_~i~0_37) 2) aux_div_main_~i~0_37 (* 2 (* aux_div_aux_mod_main_~i~0_37_28 aux_div_aux_mod_main_~i~0_37_28))) (+ main_~sum~0 aux_div_aux_mod_main_~i~0_37_28 (* (* aux_div_aux_mod_main_~i~0_37_28 aux_div_main_~i~0_37) 4)))))))} is VALID [2022-04-15 06:24:24,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {225#(and (<= 1 main_~n~0) (or (exists ((aux_div_aux_mod_aux_mod_main_~i~0_37_67_39 Int) (aux_div_aux_mod_main_~i~0_37_67 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (= main_~sum~0 (+ (* (* (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2)) (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2))) 2) (* 3 (div (+ (* (- 2) aux_div_aux_mod_main_~i~0_37_67) (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (- 2))) 1)) (<= aux_div_aux_mod_main_~i~0_37_67 (+ (div (+ (- 1) main_~n~0) 2) aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (< (+ main_~n~0 (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (+ (* 2 aux_div_aux_mod_main_~i~0_37_67) 2)))) (exists ((aux_div_main_~i~0_37 Int) (aux_div_aux_mod_main_~i~0_37_28 Int)) (and (<= aux_div_main_~i~0_37 (+ (div (+ (- 2) main_~n~0) 2) 1)) (<= 0 (* 2 aux_div_aux_mod_main_~i~0_37_28)) (< (+ (* 2 aux_div_aux_mod_main_~i~0_37_28) main_~n~0) (+ (* 2 aux_div_main_~i~0_37) 1)) (= (+ (* (* aux_div_main_~i~0_37 aux_div_main_~i~0_37) 2) aux_div_main_~i~0_37 (* 2 (* aux_div_aux_mod_main_~i~0_37_28 aux_div_aux_mod_main_~i~0_37_28))) (+ main_~sum~0 aux_div_aux_mod_main_~i~0_37_28 (* (* aux_div_aux_mod_main_~i~0_37_28 aux_div_main_~i~0_37) 4)))))))} call __VERIFIER_assert((if 2 * ~sum~0 == ~n~0 * (1 + ~n~0) then 1 else 0)); {229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:24:24,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:24:24,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-15 06:24:24,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 06:24:24,224 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-15 06:24:24,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 06:24:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:24:24,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40924439] [2022-04-15 06:24:24,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 06:24:24,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217725125] [2022-04-15 06:24:24,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217725125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:24,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:24,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:24:26,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:24:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052853775] [2022-04-15 06:24:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052853775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:24:26,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:24:26,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:24:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135188499] [2022-04-15 06:24:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:24:26,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:24:26,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:24:26,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:26,862 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-15 06:24:26,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:24:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:24:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:24:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:24:26,864 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:28,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 06:24:40,651 WARN L232 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 89 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 06:24:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:42,024 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:24:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:24:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:24:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:24:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-15 06:24:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-15 06:24:42,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-15 06:24:43,778 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-15 06:24:43,779 INFO L225 Difference]: With dead ends: 15 [2022-04-15 06:24:43,779 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:24:43,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:24:43,780 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:24:43,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 10 Unchecked, 1.7s Time] [2022-04-15 06:24:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:24:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:24:43,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:24:43,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:24:43,782 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:24:43,782 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:24:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:43,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:24:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:24:43,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:43,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:43,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:24:43,783 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:24:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:24:43,783 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:24:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:24:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:43,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:24:43,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:24:43,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:24:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:24:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:24:43,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 06:24:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:24:43,783 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:24:43,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:24:43,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:24:43,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:24:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:24:43,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:24:43,790 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:24:43,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:24:43,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 06:24:43,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:24:58,186 WARN L232 SmtUtils]: Spent 10.75s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 06:24:58,193 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:24:58,194 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-15 06:24:58,194 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-15 06:24:58,194 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 06:24:58,194 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (let ((.cse1 (* (- 1) main_~i~0))) (or (let ((.cse0 (div (+ .cse1 2) (- 2)))) (and (= 0 (mod main_~i~0 2)) (= (+ (* 3 .cse0) main_~i~0 (* (* .cse0 .cse0) 2) 1) main_~sum~0) (<= 0 .cse0))) (and (= main_~sum~0 main_~i~0) (= main_~i~0 1)) (let ((.cse2 (div (+ .cse1 1) (- 2)))) (and (= (+ main_~i~0 .cse2 (* 2 (* .cse2 .cse2))) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0) (< 0 .cse2)))))) [2022-04-15 06:24:58,195 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 31) the Hoare annotation is: (or (and (<= main_~i~0 (+ main_~n~0 1)) (let ((.cse0 (+ main_~sum~0 1)) (.cse2 (* (- 1) main_~i~0))) (or (and (= main_~i~0 2) (= .cse0 main_~i~0)) (let ((.cse1 (div (+ .cse2 2) (- 2)))) (and (= .cse0 (+ main_~i~0 .cse1 (* (* .cse1 .cse1) 2))) (= 0 (mod main_~i~0 2)) (< 0 .cse1))) (let ((.cse3 (div (+ .cse2 3) (- 2)))) (and (<= 0 .cse3) (= (+ (* .cse3 3) (* (* .cse3 .cse3) 2) main_~i~0) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0)))))) (and (<= 1 main_~n~0) (= main_~sum~0 0) (= main_~i~0 1))) [2022-04-15 06:24:58,195 INFO L878 garLoopResultBuilder]: At program point L29-4(lines 29 31) the Hoare annotation is: (and (or (exists ((aux_div_aux_mod_aux_mod_main_~i~0_37_67_39 Int) (aux_div_aux_mod_main_~i~0_37_67 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39))) (and (< .cse0 2) (= (+ (* (* aux_div_aux_mod_main_~i~0_37_67 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39) 4) main_~sum~0 (* 3 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (+ (* (* aux_div_aux_mod_aux_mod_main_~i~0_37_67_39 aux_div_aux_mod_aux_mod_main_~i~0_37_67_39) 2) (* 3 aux_div_aux_mod_main_~i~0_37_67) (* (* aux_div_aux_mod_main_~i~0_37_67 aux_div_aux_mod_main_~i~0_37_67) 2) 1)) (<= 0 .cse0) (<= aux_div_aux_mod_main_~i~0_37_67 (+ (div (+ (- 1) main_~n~0) 2) aux_div_aux_mod_aux_mod_main_~i~0_37_67_39)) (< (+ main_~n~0 .cse0) (+ (* 2 aux_div_aux_mod_main_~i~0_37_67) 2))))) (exists ((aux_div_main_~i~0_37 Int) (aux_div_aux_mod_main_~i~0_37_28 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_main_~i~0_37_28))) (and (<= aux_div_main_~i~0_37 (+ (div (+ (- 2) main_~n~0) 2) 1)) (<= 0 .cse1) (< (+ .cse1 main_~n~0) (+ (* 2 aux_div_main_~i~0_37) 1)) (= (+ (* (* aux_div_main_~i~0_37 aux_div_main_~i~0_37) 2) aux_div_main_~i~0_37 (* 2 (* aux_div_aux_mod_main_~i~0_37_28 aux_div_aux_mod_main_~i~0_37_28))) (+ main_~sum~0 aux_div_aux_mod_main_~i~0_37_28 (* (* aux_div_aux_mod_main_~i~0_37_28 aux_div_main_~i~0_37) 4))))))) (<= main_~i~0 (+ main_~n~0 1)) (let ((.cse2 (+ main_~sum~0 1)) (.cse4 (* (- 1) main_~i~0))) (or (and (= main_~i~0 2) (= .cse2 main_~i~0)) (let ((.cse3 (div (+ .cse4 2) (- 2)))) (and (= .cse2 (+ main_~i~0 .cse3 (* (* .cse3 .cse3) 2))) (= 0 (mod main_~i~0 2)) (< 0 .cse3))) (let ((.cse5 (div (+ .cse4 3) (- 2)))) (and (<= 0 .cse5) (= (+ (* .cse5 3) (* (* .cse5 .cse5) 2) main_~i~0) main_~sum~0)))))) [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,195 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-15 06:24:58,196 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 06:24:58,196 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 06:24:58,196 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 06:24:58,199 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 06:24:58,200 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:24:58,202 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:24:58,202 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:24:58,203 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:24:58,203 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 06:24:58,203 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:24:58,203 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:24:58,205 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 06:25:00,583 INFO L163 areAnnotationChecker]: CFG has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:25:00,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:25:00 BoogieIcfgContainer [2022-04-15 06:25:00,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:25:00,596 INFO L158 Benchmark]: Toolchain (without parser) took 193182.17ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 136.3MB in the beginning and 163.9MB in the end (delta: -27.6MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-15 06:25:00,597 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:25:00,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 163.1MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:25:00,598 INFO L158 Benchmark]: Boogie Preprocessor took 37.07ms. Allocated memory is still 184.5MB. Free memory was 163.1MB in the beginning and 161.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:25:00,598 INFO L158 Benchmark]: RCFGBuilder took 335.35ms. Allocated memory is still 184.5MB. Free memory was 161.4MB in the beginning and 150.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 06:25:00,599 INFO L158 Benchmark]: TraceAbstraction took 192589.14ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 149.9MB in the beginning and 163.9MB in the end (delta: -14.0MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2022-04-15 06:25:00,601 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.13ms. Allocated memory is still 184.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 163.1MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.07ms. Allocated memory is still 184.5MB. Free memory was 163.1MB in the beginning and 161.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.35ms. Allocated memory is still 184.5MB. Free memory was 161.4MB in the beginning and 150.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 192589.14ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 149.9MB in the beginning and 163.9MB in the end (delta: -14.0MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 190.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 28 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 27 PreInvPairs, 36 NumberOfFragments, 461 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (i <= n + 1 && (((i == 2 && sum + 1 == i) || ((sum + 1 == i + (-1 * i + 2) / -2 + (-1 * i + 2) / -2 * ((-1 * i + 2) / -2) * 2 && 0 == i % 2) && 0 < (-1 * i + 2) / -2)) || ((0 <= (-1 * i + 3) / -2 && (-1 * i + 3) / -2 * 3 + (-1 * i + 3) / -2 * ((-1 * i + 3) / -2) * 2 + i == sum) && (i + 1) % 2 == 0))) || ((1 <= n && sum == 0) && i == 1) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:25:00,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...