/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:35,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:35,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:35,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:35,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:35,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:35,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:35,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:35,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:35,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:35,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:35,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:35,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:35,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:35,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:35,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:35,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:35,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:35,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:35,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:35,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:35,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:35,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:35,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:35,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:35,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:35,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:35,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:35,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:35,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:35,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:35,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:35,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:35,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:35,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:35,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:35,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:35,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:35,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:35,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:35,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:35,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:35,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:35,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:35,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:35,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:35,387 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:35,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:35,387 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:35,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:35,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:35,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:35,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:35,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:35,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:35,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:35,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:35,392 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:35,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:35,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:35,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:35,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:35,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:35,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:35,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:35,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:35,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:35,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:35,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:35,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:35,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:35,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:35,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:35,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:35,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:35,723 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:35,724 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:35,725 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2020-07-10 15:27:35,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e677c5785/66c5d052b8ac4cd9a9fccc7bd71a095e/FLAG65e4ad1dd [2020-07-10 15:27:36,388 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:36,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2020-07-10 15:27:36,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e677c5785/66c5d052b8ac4cd9a9fccc7bd71a095e/FLAG65e4ad1dd [2020-07-10 15:27:36,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e677c5785/66c5d052b8ac4cd9a9fccc7bd71a095e [2020-07-10 15:27:36,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:36,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:36,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:36,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:36,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:36,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e89f8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36, skipping insertion in model container [2020-07-10 15:27:36,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:36,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:37,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:37,008 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:37,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:37,045 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:37,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37 WrapperNode [2020-07-10 15:27:37,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:37,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:37,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:37,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:37,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... [2020-07-10 15:27:37,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:37,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:37,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:37,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:37,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:37,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:37,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:37,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:37,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:37,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:37,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:37,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:37,613 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:37,614 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:37,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37 BoogieIcfgContainer [2020-07-10 15:27:37,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:37,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:37,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:37,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:37,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:36" (1/3) ... [2020-07-10 15:27:37,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af00f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:37" (2/3) ... [2020-07-10 15:27:37,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af00f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37" (3/3) ... [2020-07-10 15:27:37,643 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2020-07-10 15:27:37,655 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:37,663 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:37,677 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:37,702 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:37,703 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:37,704 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:37,704 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:37,704 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:37,705 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:37,705 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:37,705 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:27:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:37,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:37,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:37,737 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 579653156, now seen corresponding path program 1 times [2020-07-10 15:27:37,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:37,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180074599] [2020-07-10 15:27:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:37,903 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2020-07-10 15:27:37,906 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-10 15:27:37,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:27:37,907 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2020-07-10 15:27:37,907 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2020-07-10 15:27:37,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {22#true} is VALID [2020-07-10 15:27:37,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {22#true} is VALID [2020-07-10 15:27:37,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-10 15:27:37,910 INFO L263 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2020-07-10 15:27:37,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-10 15:27:37,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-10 15:27:37,910 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:27:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:37,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180074599] [2020-07-10 15:27:37,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:37,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:37,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625793214] [2020-07-10 15:27:37,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:27:37,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:37,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:37,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:37,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:37,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:37,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:37,993 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-10 15:27:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,068 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:27:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:38,068 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:27:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-10 15:27:38,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-10 15:27:38,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,217 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:27:38,217 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:27:38,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:27:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:27:38,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:38,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:38,266 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:38,267 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,271 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:27:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:38,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,272 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:38,273 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,276 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:27:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:38,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:38,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:27:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:27:38,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-10 15:27:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:38,284 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:27:38,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:38,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:38,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:38,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:38,286 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 574112030, now seen corresponding path program 1 times [2020-07-10 15:27:38,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:38,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302912575] [2020-07-10 15:27:38,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:38,423 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #36#return; {113#true} is VALID [2020-07-10 15:27:38,423 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-10 15:27:38,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-10 15:27:38,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #36#return; {113#true} is VALID [2020-07-10 15:27:38,425 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret2 := main(); {113#true} is VALID [2020-07-10 15:27:38,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {117#(= 0 main_~sn~0)} is VALID [2020-07-10 15:27:38,428 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(= 0 main_~sn~0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {117#(= 0 main_~sn~0)} is VALID [2020-07-10 15:27:38,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {117#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {117#(= 0 main_~sn~0)} is VALID [2020-07-10 15:27:38,433 INFO L263 TraceCheckUtils]: 7: Hoare triple {117#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:38,435 INFO L280 TraceCheckUtils]: 8: Hoare triple {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {119#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:38,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {114#false} is VALID [2020-07-10 15:27:38,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-10 15:27:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:38,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302912575] [2020-07-10 15:27:38,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:38,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:38,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144673566] [2020-07-10 15:27:38,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:27:38,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:38,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:38,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:38,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:38,467 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2020-07-10 15:27:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,581 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:27:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:38,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:27:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 15:27:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 15:27:38,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-10 15:27:38,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:38,625 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:27:38,625 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:27:38,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:27:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:27:38,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:38,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:27:38,639 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:27:38,639 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:27:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,642 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:27:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:27:38,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,643 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:27:38,643 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:27:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,646 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:27:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:27:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:38,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:38,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:38,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:27:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:27:38,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2020-07-10 15:27:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:38,650 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:27:38,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:27:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:27:38,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:38,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:38,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:38,653 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1164206820, now seen corresponding path program 1 times [2020-07-10 15:27:38,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:38,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088560434] [2020-07-10 15:27:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:38,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-10 15:27:38,974 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {203#true} {203#true} #36#return; {203#true} is VALID [2020-07-10 15:27:38,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2020-07-10 15:27:38,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-10 15:27:38,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #36#return; {203#true} is VALID [2020-07-10 15:27:38,975 INFO L263 TraceCheckUtils]: 3: Hoare triple {203#true} call #t~ret2 := main(); {203#true} is VALID [2020-07-10 15:27:38,979 INFO L280 TraceCheckUtils]: 4: Hoare triple {203#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {207#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:38,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {207#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {208#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:38,992 INFO L280 TraceCheckUtils]: 6: Hoare triple {208#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {209#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-10 15:27:38,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {209#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {210#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-10 15:27:39,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {210#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {211#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 15:27:39,018 INFO L263 TraceCheckUtils]: 9: Hoare triple {211#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {212#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:39,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {212#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {213#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:39,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {213#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {204#false} is VALID [2020-07-10 15:27:39,025 INFO L280 TraceCheckUtils]: 12: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-10 15:27:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:39,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088560434] [2020-07-10 15:27:39,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236563579] [2020-07-10 15:27:39,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:27:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:39,325 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,338 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,388 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:39,403 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:39,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2020-07-10 15:27:39,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2020-07-10 15:27:39,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #36#return; {203#true} is VALID [2020-07-10 15:27:39,520 INFO L263 TraceCheckUtils]: 3: Hoare triple {203#true} call #t~ret2 := main(); {203#true} is VALID [2020-07-10 15:27:39,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {203#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {207#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:39,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {207#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {232#(and (= 1 main_~i~0) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:39,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {232#(and (= 1 main_~i~0) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {236#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:39,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {240#(and (<= main_~i~0 2) (<= main_~sn~0 2) (<= 1 main_~n~0) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:39,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {240#(and (<= main_~i~0 2) (<= main_~sn~0 2) (<= 1 main_~n~0) (<= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {244#(and (<= main_~sn~0 2) (<= 1 main_~n~0) (<= 2 main_~sn~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:27:39,527 INFO L263 TraceCheckUtils]: 9: Hoare triple {244#(and (<= main_~sn~0 2) (<= 1 main_~n~0) (<= 2 main_~sn~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:39,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:39,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {204#false} is VALID [2020-07-10 15:27:39,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {204#false} assume !false; {204#false} is VALID [2020-07-10 15:27:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:39,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:39,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-10 15:27:39,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019597118] [2020-07-10 15:27:39,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2020-07-10 15:27:39,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:39,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:27:39,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:39,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:27:39,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:27:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:27:39,564 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 15 states. [2020-07-10 15:27:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,997 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 15:27:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:27:39,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2020-07-10 15:27:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2020-07-10 15:27:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2020-07-10 15:27:40,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2020-07-10 15:27:40,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:40,056 INFO L225 Difference]: With dead ends: 24 [2020-07-10 15:27:40,057 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:27:40,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:27:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:27:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:27:40,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:40,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:40,088 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:40,088 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,090 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:40,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,091 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:40,092 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:27:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,096 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:27:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:40,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:40,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:27:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-10 15:27:40,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2020-07-10 15:27:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:40,100 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-10 15:27:40,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:27:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:27:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:27:40,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:40,101 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:40,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:40,316 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2033115496, now seen corresponding path program 2 times [2020-07-10 15:27:40,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:40,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018605519] [2020-07-10 15:27:40,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {365#true} assume true; {365#true} is VALID [2020-07-10 15:27:40,643 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {365#true} {365#true} #36#return; {365#true} is VALID [2020-07-10 15:27:40,644 INFO L263 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2020-07-10 15:27:40,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {365#true} assume true; {365#true} is VALID [2020-07-10 15:27:40,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {365#true} {365#true} #36#return; {365#true} is VALID [2020-07-10 15:27:40,645 INFO L263 TraceCheckUtils]: 3: Hoare triple {365#true} call #t~ret2 := main(); {365#true} is VALID [2020-07-10 15:27:40,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {365#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {369#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:40,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {369#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {371#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,654 INFO L280 TraceCheckUtils]: 8: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {371#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 15:27:40,658 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-10 15:27:40,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-10 15:27:40,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-10 15:27:40,664 INFO L263 TraceCheckUtils]: 13: Hoare triple {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:27:40,666 INFO L280 TraceCheckUtils]: 14: Hoare triple {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {376#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:27:40,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {366#false} is VALID [2020-07-10 15:27:40,667 INFO L280 TraceCheckUtils]: 16: Hoare triple {366#false} assume !false; {366#false} is VALID [2020-07-10 15:27:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:27:40,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018605519] [2020-07-10 15:27:40,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909636930] [2020-07-10 15:27:40,669 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:40,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:40,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:40,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-10 15:27:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:41,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:41,104 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:41,130 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:41,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:41,254 INFO L263 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2020-07-10 15:27:41,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {365#true} assume true; {365#true} is VALID [2020-07-10 15:27:41,255 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {365#true} {365#true} #36#return; {365#true} is VALID [2020-07-10 15:27:41,256 INFO L263 TraceCheckUtils]: 3: Hoare triple {365#true} call #t~ret2 := main(); {365#true} is VALID [2020-07-10 15:27:41,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {365#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {369#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:41,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {369#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {395#(and (= 1 main_~i~0) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 15:27:41,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {395#(and (= 1 main_~i~0) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {399#(and (= 1 main_~i~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:41,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {399#(and (= 1 main_~i~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {403#(and (= 2 main_~i~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2020-07-10 15:27:41,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {403#(and (= 2 main_~i~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {407#(and (= 2 main_~i~0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:41,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {407#(and (= 2 main_~i~0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {411#(and (= 3 main_~i~0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2020-07-10 15:27:41,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {411#(and (= 3 main_~i~0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {415#(and (= 3 main_~i~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0) (<= 6 main_~sn~0))} is VALID [2020-07-10 15:27:41,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {415#(and (= 3 main_~i~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0) (<= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {419#(and (<= main_~sn~0 6) (<= main_~i~0 4) (<= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-10 15:27:41,271 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#(and (<= main_~sn~0 6) (<= main_~i~0 4) (<= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {423#(and (<= main_~sn~0 6) (<= main_~n~0 3) (<= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-10 15:27:41,272 INFO L263 TraceCheckUtils]: 13: Hoare triple {423#(and (<= main_~sn~0 6) (<= main_~n~0 3) (<= 6 main_~sn~0) (<= 3 main_~n~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:41,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:41,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2020-07-10 15:27:41,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {366#false} assume !false; {366#false} is VALID [2020-07-10 15:27:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:41,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:41,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2020-07-10 15:27:41,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238224877] [2020-07-10 15:27:41,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2020-07-10 15:27:41,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:41,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 15:27:41,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:41,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 15:27:41,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 15:27:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:27:41,315 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 20 states. [2020-07-10 15:27:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,037 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-10 15:27:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:27:42,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2020-07-10 15:27:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:27:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-10 15:27:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:27:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-10 15:27:42,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 22 transitions. [2020-07-10 15:27:42,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:42,084 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:27:42,084 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:42,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2020-07-10 15:27:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:42,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:42,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:42,086 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:42,086 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,086 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:42,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:42,091 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,092 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:42,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:42,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:42,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-10 15:27:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:42,093 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:42,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 15:27:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:42,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:42,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:42,432 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:27:42,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:42,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:42,432 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:27:42,433 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:42,433 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:42,433 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-10 15:27:42,433 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2020-07-10 15:27:42,435 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-10 15:27:42,435 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2020-07-10 15:27:42,435 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2020-07-10 15:27:42,436 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 16) the Hoare annotation is: (or (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= main_~sn~0 (* 2 main_~n~0)) (<= .cse1 .cse0))) (and (= 1 main_~i~0) (= 0 main_~sn~0))) [2020-07-10 15:27:42,436 INFO L264 CegarLoopResult]: At program point L14-4(lines 14 16) the Hoare annotation is: (or (let ((.cse0 (* 2 main_~n~0))) (and (<= main_~sn~0 .cse0) (<= .cse0 main_~sn~0))) (= 0 main_~sn~0)) [2020-07-10 15:27:42,436 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2020-07-10 15:27:42,436 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-10 15:27:42,436 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-10 15:27:42,436 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-10 15:27:42,437 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-10 15:27:42,437 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2020-07-10 15:27:42,444 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:42,444 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:42,444 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:42,445 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:42,450 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:27:42,451 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:42,451 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:42,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:42 BoogieIcfgContainer [2020-07-10 15:27:42,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:42,482 INFO L168 Benchmark]: Toolchain (without parser) took 5735.50 ms. Allocated memory was 139.5 MB in the beginning and 276.8 MB in the end (delta: 137.4 MB). Free memory was 102.8 MB in the beginning and 200.1 MB in the end (delta: -97.3 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,485 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.20 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,489 INFO L168 Benchmark]: Boogie Preprocessor took 129.11 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 182.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,489 INFO L168 Benchmark]: RCFGBuilder took 447.55 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 166.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,494 INFO L168 Benchmark]: TraceAbstraction took 4845.65 ms. Allocated memory was 203.4 MB in the beginning and 276.8 MB in the end (delta: 73.4 MB). Free memory was 166.0 MB in the beginning and 200.1 MB in the end (delta: -34.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:42,501 INFO L336 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.35 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.20 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.11 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 182.7 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 447.55 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 166.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4845.65 ms. Allocated memory was 203.4 MB in the beginning and 276.8 MB in the end (delta: 73.4 MB). Free memory was 166.0 MB in the beginning and 200.1 MB in the end (delta: -34.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((sn + 2 <= 2 * i && sn <= 2 * n) && 2 * i <= sn + 2) || (1 == i && 0 == sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 11 SDslu, 165 SDs, 0 SdLazy, 198 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 48 HoareAnnotationTreeSize, 12 FomulaSimplifications, 57 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 5964 SizeOfPredicates, 6 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...