/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:47,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:47,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:47,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:47,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:47,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:47,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:47,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:47,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:47,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:47,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:47,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:47,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:47,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:47,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:47,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:47,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:47,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:47,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:47,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:47,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:47,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:47,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:47,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:47,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:47,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:47,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:47,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:47,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:47,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:47,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:47,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:47,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:47,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:47,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:47,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:47,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:47,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:47,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:47,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:47,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:47,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:47,791 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:47,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:47,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:47,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:47,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:47,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:47,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:47,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:47,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:47,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:47,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:47,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:47,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:47,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:47,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:47,796 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:47,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:47,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:47,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:47,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:47,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:47,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:47,798 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:48,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:48,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:48,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:48,148 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:48,149 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:48,149 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-10 20:21:48,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd4aa210/f0c4e0d10a23475ea95b8304ecaefde3/FLAG35b584aa6 [2020-07-10 20:21:48,649 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:48,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-10 20:21:48,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd4aa210/f0c4e0d10a23475ea95b8304ecaefde3/FLAG35b584aa6 [2020-07-10 20:21:49,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd4aa210/f0c4e0d10a23475ea95b8304ecaefde3 [2020-07-10 20:21:49,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:49,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:49,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:49,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:49,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:49,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dca7afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49, skipping insertion in model container [2020-07-10 20:21:49,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:49,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:49,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:49,249 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:49,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:49,283 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:49,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49 WrapperNode [2020-07-10 20:21:49,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:49,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:49,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:49,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:49,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (1/1) ... [2020-07-10 20:21:49,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:49,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:49,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:49,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:49,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21: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-10 20:21:49,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:49,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:49,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:49,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:49,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:49,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:49,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:49,779 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:49,779 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:21:49,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:49 BoogieIcfgContainer [2020-07-10 20:21:49,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:49,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:49,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:49,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:49,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:49" (1/3) ... [2020-07-10 20:21:49,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761a406b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:49, skipping insertion in model container [2020-07-10 20:21:49,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:49" (2/3) ... [2020-07-10 20:21:49,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761a406b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:49, skipping insertion in model container [2020-07-10 20:21:49,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:49" (3/3) ... [2020-07-10 20:21:49,793 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-10 20:21:49,805 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:49,813 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:49,830 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:49,855 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:49,856 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:49,856 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:49,856 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:49,856 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:49,856 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:49,857 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:49,857 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 20:21:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 20:21:49,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:49,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:49,889 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash 546510172, now seen corresponding path program 1 times [2020-07-10 20:21:49,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:49,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547670774] [2020-07-10 20:21:49,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:50,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 20:21:50,052 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-10 20:21:50,054 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-10 20:21:50,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 20:21:50,057 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-10 20:21:50,057 INFO L263 TraceCheckUtils]: 3: Hoare triple {40#true} call #t~ret3 := main(); {40#true} is VALID [2020-07-10 20:21:50,058 INFO L280 TraceCheckUtils]: 4: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-10 20:21:50,059 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} ~x~0 := 0; {40#true} is VALID [2020-07-10 20:21:50,059 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} ~y~0 := 0; {40#true} is VALID [2020-07-10 20:21:50,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {40#true} is VALID [2020-07-10 20:21:50,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~n~0 := #t~nondet0; {40#true} is VALID [2020-07-10 20:21:50,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} havoc #t~nondet0; {40#true} is VALID [2020-07-10 20:21:50,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#true} assume !!(~n~0 > 0); {40#true} is VALID [2020-07-10 20:21:50,064 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-10 20:21:50,065 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-10 20:21:50,066 INFO L263 TraceCheckUtils]: 13: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {41#false} is VALID [2020-07-10 20:21:50,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-10 20:21:50,067 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-10 20:21:50,067 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 20:21:50,070 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 20:21:50,070 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:50,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547670774] [2020-07-10 20:21:50,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:50,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:21:50,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535890310] [2020-07-10 20:21:50,089 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-10 20:21:50,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:50,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:21:50,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:50,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:21:50,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:21:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:21:50,214 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-10 20:21:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,366 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2020-07-10 20:21:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:21:50,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-10 20:21:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:21:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-10 20:21:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:21:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-10 20:21:50,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2020-07-10 20:21:50,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:50,530 INFO L225 Difference]: With dead ends: 61 [2020-07-10 20:21:50,530 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 20:21:50,535 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 20:21:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 20:21:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 20:21:50,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:50,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 20:21:50,596 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:21:50,597 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:21:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,603 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:21:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:21:50,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:50,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:50,605 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 20:21:50,605 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 20:21:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,611 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 20:21:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:21:50,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:50,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:50,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:50,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:21:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-10 20:21:50,618 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2020-07-10 20:21:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:50,619 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-10 20:21:50,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:21:50,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-10 20:21:50,669 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-10 20:21:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 20:21:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 20:21:50,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:50,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:50,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:50,671 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 528039752, now seen corresponding path program 1 times [2020-07-10 20:21:50,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:50,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958382385] [2020-07-10 20:21:50,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:50,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 20:21:50,751 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-10 20:21:50,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2020-07-10 20:21:50,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-10 20:21:50,752 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-10 20:21:50,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret3 := main(); {292#true} is VALID [2020-07-10 20:21:50,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {292#true} ~i~0 := 0; {292#true} is VALID [2020-07-10 20:21:50,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#true} ~x~0 := 0; {292#true} is VALID [2020-07-10 20:21:50,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {292#true} ~y~0 := 0; {292#true} is VALID [2020-07-10 20:21:50,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {292#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {292#true} is VALID [2020-07-10 20:21:50,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {292#true} ~n~0 := #t~nondet0; {292#true} is VALID [2020-07-10 20:21:50,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#true} havoc #t~nondet0; {292#true} is VALID [2020-07-10 20:21:50,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#true} assume !!(~n~0 > 0); {296#(<= 1 main_~n~0)} is VALID [2020-07-10 20:21:50,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(<= 1 main_~n~0)} ~i~0 := 0; {297#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-10 20:21:50,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {297#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {293#false} is VALID [2020-07-10 20:21:50,759 INFO L263 TraceCheckUtils]: 13: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {293#false} is VALID [2020-07-10 20:21:50,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2020-07-10 20:21:50,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2020-07-10 20:21:50,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-10 20:21:50,762 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 20:21:50,762 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:50,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958382385] [2020-07-10 20:21:50,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:50,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:21:50,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652914765] [2020-07-10 20:21:50,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 20:21:50,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:50,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:21:50,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:21:50,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:21:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:21:50,790 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-10 20:21:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:50,966 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 20:21:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:21:50,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 20:21:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:21:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 20:21:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:21:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-10 20:21:50,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-10 20:21:51,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:51,029 INFO L225 Difference]: With dead ends: 39 [2020-07-10 20:21:51,029 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 20:21:51,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 20:21:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 20:21:51,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:51,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 20:21:51,069 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 20:21:51,069 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 20:21:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:51,072 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 20:21:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 20:21:51,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:51,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:51,074 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 20:21:51,074 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 20:21:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:51,077 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 20:21:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 20:21:51,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:51,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:51,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:51,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:21:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-10 20:21:51,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2020-07-10 20:21:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:51,082 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-10 20:21:51,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:21:51,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-10 20:21:51,126 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 20:21:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-10 20:21:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 20:21:51,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:51,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:51,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:51,128 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -789875431, now seen corresponding path program 1 times [2020-07-10 20:21:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:51,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895912541] [2020-07-10 20:21:51,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:51,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-10 20:21:51,287 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-10 20:21:51,287 INFO L263 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2020-07-10 20:21:51,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-10 20:21:51,288 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-10 20:21:51,288 INFO L263 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret3 := main(); {508#true} is VALID [2020-07-10 20:21:51,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {508#true} ~i~0 := 0; {508#true} is VALID [2020-07-10 20:21:51,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {508#true} ~x~0 := 0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:51,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,301 INFO L280 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:51,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:51,304 INFO L263 TraceCheckUtils]: 14: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:21:51,306 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {515#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:21:51,307 INFO L280 TraceCheckUtils]: 16: Hoare triple {515#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {509#false} is VALID [2020-07-10 20:21:51,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {509#false} assume !false; {509#false} is VALID [2020-07-10 20:21:51,309 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 20:21:51,310 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:51,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895912541] [2020-07-10 20:21:51,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:51,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:21:51,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674148476] [2020-07-10 20:21:51,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 20:21:51,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:51,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:21:51,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:51,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:21:51,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:51,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:21:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:51,338 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2020-07-10 20:21:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:51,682 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-10 20:21:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:21:51,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-10 20:21:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:21:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-10 20:21:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:21:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-10 20:21:51,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-10 20:21:51,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:51,762 INFO L225 Difference]: With dead ends: 42 [2020-07-10 20:21:51,762 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 20:21:51,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:21:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 20:21:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2020-07-10 20:21:51,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:51,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2020-07-10 20:21:51,854 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2020-07-10 20:21:51,855 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2020-07-10 20:21:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:51,858 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:21:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:21:51,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:51,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:51,859 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2020-07-10 20:21:51,860 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2020-07-10 20:21:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:51,863 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:21:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:21:51,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:51,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:51,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:51,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:21:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-10 20:21:51,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 18 [2020-07-10 20:21:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:51,867 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-10 20:21:51,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:21:51,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-10 20:21:51,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 20:21:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 20:21:51,923 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:51,923 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:51,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:51,924 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1565658423, now seen corresponding path program 1 times [2020-07-10 20:21:51,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:51,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221196409] [2020-07-10 20:21:51,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:52,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-10 20:21:52,129 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-10 20:21:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:52,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-10 20:21:52,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-10 20:21:52,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-10 20:21:52,152 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,152 INFO L263 TraceCheckUtils]: 0: Hoare triple {758#true} call ULTIMATE.init(); {758#true} is VALID [2020-07-10 20:21:52,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-10 20:21:52,153 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-10 20:21:52,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {758#true} call #t~ret3 := main(); {758#true} is VALID [2020-07-10 20:21:52,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {758#true} ~i~0 := 0; {758#true} is VALID [2020-07-10 20:21:52,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {758#true} ~x~0 := 0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,155 INFO L280 TraceCheckUtils]: 6: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,160 INFO L280 TraceCheckUtils]: 10: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,161 INFO L280 TraceCheckUtils]: 11: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-10 20:21:52,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,168 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {758#true} is VALID [2020-07-10 20:21:52,168 INFO L280 TraceCheckUtils]: 15: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-10 20:21:52,168 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-10 20:21:52,169 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-10 20:21:52,170 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := #t~nondet2; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,179 INFO L280 TraceCheckUtils]: 21: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} havoc #t~nondet2; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-10 20:21:52,180 INFO L280 TraceCheckUtils]: 22: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(0 != ~y~0); {768#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} is VALID [2020-07-10 20:21:52,182 INFO L280 TraceCheckUtils]: 23: Hoare triple {768#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} ~x~0 := ~x~0 + ~y~0; {769#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-10 20:21:52,183 INFO L263 TraceCheckUtils]: 24: Hoare triple {769#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {770#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:21:52,184 INFO L280 TraceCheckUtils]: 25: Hoare triple {770#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {771#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:21:52,185 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {759#false} is VALID [2020-07-10 20:21:52,186 INFO L280 TraceCheckUtils]: 27: Hoare triple {759#false} assume !false; {759#false} is VALID [2020-07-10 20:21:52,188 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 20:21:52,189 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:52,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221196409] [2020-07-10 20:21:52,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:52,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:21:52,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006282850] [2020-07-10 20:21:52,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 20:21:52,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:52,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:21:52,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:52,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:21:52,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:52,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:21:52,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:21:52,233 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2020-07-10 20:21:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:52,826 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-10 20:21:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:21:52,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 20:21:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:21:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-10 20:21:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:21:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-10 20:21:52,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-10 20:21:52,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:52,921 INFO L225 Difference]: With dead ends: 46 [2020-07-10 20:21:52,921 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 20:21:52,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:21:52,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 20:21:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2020-07-10 20:21:53,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:53,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2020-07-10 20:21:53,037 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2020-07-10 20:21:53,037 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2020-07-10 20:21:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:53,041 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-10 20:21:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-10 20:21:53,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:53,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:53,042 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2020-07-10 20:21:53,043 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2020-07-10 20:21:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:53,046 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-10 20:21:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-10 20:21:53,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:53,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:53,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:53,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 20:21:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-10 20:21:53,053 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2020-07-10 20:21:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:53,053 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-10 20:21:53,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:21:53,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-10 20:21:53,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:21:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:53,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:53,116 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:53,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:21:53,116 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1612602333, now seen corresponding path program 1 times [2020-07-10 20:21:53,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:53,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210459109] [2020-07-10 20:21:53,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 20:21:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 20:21:53,251 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:53,251 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-10 20:21:53,252 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 20:21:53,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:21:53,274 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 20:21:53,274 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 20:21:53,274 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 20:21:53,274 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:21:53,275 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 20:21:53,275 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 20:21:53,275 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 20:21:53,275 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-10 20:21:53,276 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 20:21:53,277 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 20:21:53,278 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-10 20:21:53,279 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 20:21:53,280 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 20:21:53,281 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:21:53,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:21:53 BoogieIcfgContainer [2020-07-10 20:21:53,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:21:53,289 INFO L168 Benchmark]: Toolchain (without parser) took 4251.80 ms. Allocated memory was 136.3 MB in the beginning and 256.9 MB in the end (delta: 120.6 MB). Free memory was 98.8 MB in the beginning and 203.8 MB in the end (delta: -105.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:53,291 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:53,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.60 ms. Allocated memory is still 136.3 MB. Free memory was 98.6 MB in the beginning and 88.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 20:21:53,294 INFO L168 Benchmark]: Boogie Preprocessor took 118.27 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 179.8 MB in the end (delta: -91.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:53,301 INFO L168 Benchmark]: RCFGBuilder took 381.54 ms. Allocated memory is still 199.8 MB. Free memory was 179.8 MB in the beginning and 158.4 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:53,307 INFO L168 Benchmark]: TraceAbstraction took 3499.41 ms. Allocated memory was 199.8 MB in the beginning and 256.9 MB in the end (delta: 57.1 MB). Free memory was 158.4 MB in the beginning and 203.8 MB in the end (delta: -45.4 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:53,312 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.22 ms. Allocated memory is still 136.3 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.60 ms. Allocated memory is still 136.3 MB. Free memory was 98.6 MB in the beginning and 88.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 118.27 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 179.8 MB in the end (delta: -91.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 381.54 ms. Allocated memory is still 199.8 MB. Free memory was 179.8 MB in the beginning and 158.4 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3499.41 ms. Allocated memory was 199.8 MB in the beginning and 256.9 MB in the end (delta: 57.1 MB). Free memory was 158.4 MB in the beginning and 203.8 MB in the end (delta: -45.4 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 [L20] COND TRUE i