/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:47,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:47,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:47,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:47,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:47,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:47,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:47,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:47,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:47,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:47,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:47,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:47,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:47,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:47,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:47,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:47,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:47,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:47,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:47,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:47,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:47,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:47,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:47,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:47,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:47,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:47,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:47,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:47,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:47,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:47,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:47,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:47,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:47,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:47,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:47,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:47,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:47,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:47,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:47,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:47,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:47,663 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:27:47,672 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:47,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:47,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:47,673 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:47,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:47,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:47,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:47,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:47,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:47,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:47,675 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:47,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:47,675 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:47,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:47,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:47,676 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:47,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:47,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:47,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:47,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:47,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:47,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:47,677 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:27:47,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:47,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:47,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:47,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:47,978 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:47,978 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-11 02:27:48,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738e604b0/698e2c33e04f48caa050803e36858fb1/FLAGb37fc3307 [2020-07-11 02:27:48,530 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:48,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2020-07-11 02:27:48,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738e604b0/698e2c33e04f48caa050803e36858fb1/FLAGb37fc3307 [2020-07-11 02:27:48,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738e604b0/698e2c33e04f48caa050803e36858fb1 [2020-07-11 02:27:48,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:48,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:48,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:48,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:48,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:48,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d4feeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48, skipping insertion in model container [2020-07-11 02:27:48,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:48,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:49,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:49,185 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:49,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:49,223 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:49,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49 WrapperNode [2020-07-11 02:27:49,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:49,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:49,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:49,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:49,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (1/1) ... [2020-07-11 02:27:49,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:49,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:49,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:49,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:49,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (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-11 02:27:49,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:49,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:49,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:49,655 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:49,655 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:27:49,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49 BoogieIcfgContainer [2020-07-11 02:27:49,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:49,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:49,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:49,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:49,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:48" (1/3) ... [2020-07-11 02:27:49,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c80d080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:49" (2/3) ... [2020-07-11 02:27:49,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c80d080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49" (3/3) ... [2020-07-11 02:27:49,672 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2020-07-11 02:27:49,685 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:49,696 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:49,715 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:49,739 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:49,740 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:49,740 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:49,740 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:49,740 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:49,740 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:49,741 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:49,741 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-11 02:27:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 02:27:49,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:49,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:49,782 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2078788022, now seen corresponding path program 1 times [2020-07-11 02:27:49,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:49,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089976872] [2020-07-11 02:27:49,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-11 02:27:50,083 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #45#return; {31#true} is VALID [2020-07-11 02:27:50,085 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-11 02:27:50,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-11 02:27:50,086 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #45#return; {31#true} is VALID [2020-07-11 02:27:50,086 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-11 02:27:50,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~i~0; {31#true} is VALID [2020-07-11 02:27:50,087 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {31#true} is VALID [2020-07-11 02:27:50,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~n~0 := #t~nondet0; {31#true} is VALID [2020-07-11 02:27:50,088 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} havoc #t~nondet0; {31#true} is VALID [2020-07-11 02:27:50,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#true} ~sn~0 := 0; {35#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,091 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(= 0 main_~sn~0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000); {35#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#(= 0 main_~sn~0)} ~i~0 := 1; {35#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,095 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {35#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:50,098 INFO L263 TraceCheckUtils]: 12: Hoare triple {35#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {36#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:50,100 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {37#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:50,102 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {32#false} is VALID [2020-07-11 02:27:50,102 INFO L280 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-11 02:27:50,105 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-11 02:27:50,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089976872] [2020-07-11 02:27:50,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:50,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:50,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331599161] [2020-07-11 02:27:50,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 02:27:50,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:50,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:50,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:50,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:50,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:50,168 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2020-07-11 02:27:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,405 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-11 02:27:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:27:50,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-11 02:27:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-11 02:27:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-11 02:27:50,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2020-07-11 02:27:50,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,517 INFO L225 Difference]: With dead ends: 48 [2020-07-11 02:27:50,517 INFO L226 Difference]: Without dead ends: 23 [2020-07-11 02:27:50,521 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-11 02:27:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-11 02:27:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-11 02:27:50,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:50,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:50,574 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:50,574 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,578 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-11 02:27:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-11 02:27:50,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,580 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-11 02:27:50,580 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-11 02:27:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,584 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-11 02:27:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-11 02:27:50,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:50,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-11 02:27:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-11 02:27:50,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-07-11 02:27:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:50,591 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-11 02:27:50,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:50,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2020-07-11 02:27:50,634 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-11 02:27:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-11 02:27:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-11 02:27:50,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:50,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:50,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:50,636 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 493290783, now seen corresponding path program 1 times [2020-07-11 02:27:50,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:50,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666274217] [2020-07-11 02:27:50,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-11 02:27:51,029 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {228#true} {228#true} #45#return; {228#true} is VALID [2020-07-11 02:27:51,029 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2020-07-11 02:27:51,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-11 02:27:51,030 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #45#return; {228#true} is VALID [2020-07-11 02:27:51,030 INFO L263 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret2 := main(); {228#true} is VALID [2020-07-11 02:27:51,030 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#true} havoc ~i~0; {228#true} is VALID [2020-07-11 02:27:51,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {228#true} is VALID [2020-07-11 02:27:51,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#true} ~n~0 := #t~nondet0; {228#true} is VALID [2020-07-11 02:27:51,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#true} havoc #t~nondet0; {228#true} is VALID [2020-07-11 02:27:51,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {228#true} ~sn~0 := 0; {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:51,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000); {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:51,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {233#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:51,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {233#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {234#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:51,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {234#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {235#(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-11 02:27:51,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {235#(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; {236#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-11 02:27:51,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {236#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {237#(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-11 02:27:51,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {237#(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-11 02:27:51,041 INFO L280 TraceCheckUtils]: 16: Hoare triple {237#(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); {238#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:51,042 INFO L263 TraceCheckUtils]: 17: Hoare triple {238#(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)); {239#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:51,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {239#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {240#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:51,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {240#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {229#false} is VALID [2020-07-11 02:27:51,048 INFO L280 TraceCheckUtils]: 20: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-11 02:27:51,051 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-11 02:27:51,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666274217] [2020-07-11 02:27:51,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:51,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:27:51,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629810759] [2020-07-11 02:27:51,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-11 02:27:51,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:51,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:27:51,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:27:51,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:27:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:51,086 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 11 states. [2020-07-11 02:27:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,581 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-07-11 02:27:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:27:51,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-11 02:27:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 02:27:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2020-07-11 02:27:51,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 33 transitions. [2020-07-11 02:27:51,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,635 INFO L225 Difference]: With dead ends: 33 [2020-07-11 02:27:51,635 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 02:27:51,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:27:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 02:27:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-11 02:27:51,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:51,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-11 02:27:51,677 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-11 02:27:51,677 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-11 02:27:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,679 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 02:27:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 02:27:51,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,680 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-11 02:27:51,681 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-11 02:27:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,683 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 02:27:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 02:27:51,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:51,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-11 02:27:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-11 02:27:51,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-07-11 02:27:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:51,687 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-11 02:27:51,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:27:51,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2020-07-11 02:27:51,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-11 02:27:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:27:51,721 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:51,721 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:51,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:51,722 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -194935978, now seen corresponding path program 2 times [2020-07-11 02:27:51,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:51,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1611365760] [2020-07-11 02:27:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-11 02:27:52,151 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {429#true} {429#true} #45#return; {429#true} is VALID [2020-07-11 02:27:52,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2020-07-11 02:27:52,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {429#true} assume true; {429#true} is VALID [2020-07-11 02:27:52,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {429#true} {429#true} #45#return; {429#true} is VALID [2020-07-11 02:27:52,152 INFO L263 TraceCheckUtils]: 3: Hoare triple {429#true} call #t~ret2 := main(); {429#true} is VALID [2020-07-11 02:27:52,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {429#true} havoc ~i~0; {429#true} is VALID [2020-07-11 02:27:52,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {429#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {429#true} is VALID [2020-07-11 02:27:52,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {429#true} ~n~0 := #t~nondet0; {429#true} is VALID [2020-07-11 02:27:52,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {429#true} havoc #t~nondet0; {429#true} is VALID [2020-07-11 02:27:52,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {429#true} ~sn~0 := 0; {433#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:52,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {433#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000); {433#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:52,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {433#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,160 INFO L280 TraceCheckUtils]: 11: Hoare triple {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {435#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:27:52,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {435#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {436#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-11 02:27:52,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {436#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,166 INFO L280 TraceCheckUtils]: 15: Hoare triple {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,167 INFO L280 TraceCheckUtils]: 16: Hoare triple {434#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {437#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:52,169 INFO L280 TraceCheckUtils]: 17: Hoare triple {437#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {438#(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-11 02:27:52,170 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#(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; {439#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-11 02:27:52,171 INFO L280 TraceCheckUtils]: 19: Hoare triple {439#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {440#(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-11 02:27:52,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {440#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {440#(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-11 02:27:52,172 INFO L280 TraceCheckUtils]: 21: Hoare triple {440#(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); {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:52,174 INFO L263 TraceCheckUtils]: 22: Hoare triple {441#(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)); {442#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:52,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {442#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {443#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:52,175 INFO L280 TraceCheckUtils]: 24: Hoare triple {443#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {430#false} is VALID [2020-07-11 02:27:52,175 INFO L280 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2020-07-11 02:27:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:27:52,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1611365760] [2020-07-11 02:27:52,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:52,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:27:52,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783143168] [2020-07-11 02:27:52,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:27:52,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:52,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:27:52,213 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-11 02:27:52,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:27:52,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:27:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:27:52,215 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2020-07-11 02:27:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,839 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-11 02:27:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:27:52,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:27:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-11 02:27:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:27:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-11 02:27:52,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 23 transitions. [2020-07-11 02:27:52,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,871 INFO L225 Difference]: With dead ends: 27 [2020-07-11 02:27:52,872 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:27:52,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-11 02:27:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:27:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:27:52,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:52,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:27:52,874 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:27:52,874 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:27:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,874 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:27:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:27:52,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,875 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:27:52,875 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:27:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:27:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:27:52,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:52,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:27:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:27:52,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-11 02:27:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:52,877 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:27:52,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:27:52,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:27:52,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:27:52,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:52,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:27:53,189 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,189 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: true [2020-07-11 02:27:53,190 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse0 (* 2 main_~n~0)) (<= .cse1 .cse0))) [2020-07-11 02:27:53,190 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-11 02:27:53,190 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 18) the Hoare annotation is: true [2020-07-11 02:27:53,191 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-11 02:27:53,191 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-11 02:27:53,191 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-11 02:27:53,191 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 02:27:53,191 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 02:27:53,191 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 16) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 (* 2 main_~n~0)) (<= main_~sn~0 .cse0) (<= .cse0 main_~sn~0))) [2020-07-11 02:27:53,191 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 02:27:53,191 INFO L264 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse1 (* 2 |main_#t~post1|)) (.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 (* 2 main_~n~0)) (<= main_~sn~0 .cse0) (<= main_~sn~0 .cse1) (<= .cse1 main_~sn~0) (<= .cse0 main_~sn~0))) [2020-07-11 02:27:53,191 INFO L271 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-07-11 02:27:53,192 INFO L264 CegarLoopResult]: At program point L14-5(line 14) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2)) (.cse2 (* 2 |main_#t~post1|))) (and (<= .cse0 .cse1) (<= main_~sn~0 (* 2 main_~n~0)) (<= main_~sn~0 .cse2) (<= .cse1 .cse0) (<= .cse2 main_~sn~0))) [2020-07-11 02:27:53,192 INFO L264 CegarLoopResult]: At program point L14-6(lines 14 16) the Hoare annotation is: (let ((.cse3 (+ main_~sn~0 2)) (.cse2 (* 2 main_~i~0))) (let ((.cse0 (<= .cse3 .cse2)) (.cse1 (<= .cse2 .cse3))) (or (and .cse0 .cse1 (= 0 main_~sn~0)) (and .cse0 (<= main_~sn~0 (* 2 main_~n~0)) .cse1)))) [2020-07-11 02:27:53,192 INFO L264 CegarLoopResult]: At program point L14-7(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-11 02:27:53,192 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2020-07-11 02:27:53,192 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 4 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:27:53,193 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:27:53,193 INFO L264 CegarLoopResult]: At program point L5(lines 5 7) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:27:53,193 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:27:53,193 INFO L264 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:27:53,210 INFO L163 areAnnotationChecker]: CFG has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:27:53,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:27:53 BoogieIcfgContainer [2020-07-11 02:27:53,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:27:53,228 INFO L168 Benchmark]: Toolchain (without parser) took 4329.89 ms. Allocated memory was 137.9 MB in the beginning and 248.0 MB in the end (delta: 110.1 MB). Free memory was 102.7 MB in the beginning and 135.4 MB in the end (delta: -32.7 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,229 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.83 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,230 INFO L168 Benchmark]: Boogie Preprocessor took 117.34 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 180.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,231 INFO L168 Benchmark]: RCFGBuilder took 318.66 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 164.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,232 INFO L168 Benchmark]: TraceAbstraction took 3560.71 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 164.0 MB in the beginning and 135.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:53,237 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.92 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.83 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.34 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 180.7 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.66 ms. Allocated memory is still 201.9 MB. Free memory was 180.7 MB in the beginning and 164.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3560.71 ms. Allocated memory was 201.9 MB in the beginning and 248.0 MB in the end (delta: 46.1 MB). Free memory was 164.0 MB in the beginning and 135.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 74.8 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 && 2 * i <= sn + 2) && 0 == sn) || ((sn + 2 <= 2 * i && sn <= 2 * n) && 2 * i <= sn + 2) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 23 SDslu, 261 SDs, 0 SdLazy, 177 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 46 PreInvPairs, 67 NumberOfFragments, 201 HoareAnnotationTreeSize, 46 FomulaSimplifications, 219 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 8590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/8 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...